Nickolas S. Sapidis

Orcid: 0000-0002-9136-6117

According to our database1, Nickolas S. Sapidis authored at least 52 papers between 1987 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Enhancing operational research in mechatronic systems via modularization: comparative analysis of four clustering algorithms using validation indices.
Oper. Res., December, 2024

2023
Special Issue in the Memory of Herb Voelcker.
Comput. Aided Des., June, 2023

2022
Numerical Shape Interrogation of Planar Generalized Cubic Curves.
Comput. Aided Des., 2022

2020
Inflection points on 3D curves.
Comput. Aided Geom. Des., 2020

Shape Analysis of Generalized Cubic Curves.
Comput. Aided Des., 2020

2019
Cubic polynomial and cubic rational C1 sign, monotonicity and convexity preserving Hermite interpolation.
J. Comput. Appl. Math., 2019

2018
C1 sign, monotonicity and convexity preserving Hermite polynomial splines of variable degree.
J. Comput. Appl. Math., 2018

2016
A CAD Tribute to Gerald Farin.
Comput. Aided Des., 2016

Automatic Assembly Design for Engineering-to-Order Products Based on Multiple Models and Assembly Features.
Proceedings of the Product Lifecycle Management for Digital Transformation of Industries, 2016

2013
A Provable Algorithm to Detect Weak Symmetry in a Polygon.
Int. J. Image Graph., 2013

Inferring mirror symmetric 3D shapes from sketches.
Comput. Aided Des., 2013

2011
3D Object Modeling using Sketches.
Inf. Resour. Manag. J., 2011

An Algorithm to Detect the Weak-Symmetry of a Simple Polygon.
Proceedings of the Image Analysis and Recognition - 8th International Conference, 2011

2010
Protrusion-oriented 3D mesh segmentation.
Vis. Comput., 2010

3D articulated object retrieval using a graph-based representation.
Vis. Comput., 2010

A virtual reality system for the determination of critical machining-process parameters.
Int. J. Intell. Eng. Informatics, 2010

2009
From sketch to solid: an algebraic cross-section criterion for the realizability of a wireframe sketch.
Computing, 2009

Extracting a polyhedron from a single-view sketch: Topological construction of a wireframe sketch with minimal hidden elements.
Comput. Graph., 2009

Retrieval of 3D Articulated Objects Using a Graph-based Representation.
Proceedings of the 2nd Eurographics Workshop on 3D Object Retrieval, 2009

2008
An interactive sketching method for 3D object modeling.
Proceedings of the Third International Conference on Digital Interactive Media in Entertainment and Arts, 2008

2007
Coiflet Based Methods for Range Image Processing.
Int. J. Image Graph., 2007

Geometric modeling of spatial constraints: objectives, methods and solid-modeling requirements.
Computing, 2007

Product design using point-cloud surfaces: A recursive subdivision technique for point parameterization.
Comput. Ind., 2007

2005
A thorough encyclopaedia on geometric modelling, its foundations, methods and applications: Handbook of computer aided geometric design, Gerald Farin, Josef Hoschek, Myung-Soo Kim.
Comput. Aided Des., 2005

Drawing curves onto a cloud of points for point-based modelling.
Comput. Aided Des., 2005

Efficient Parameterization of 3D Point-Sets Using Recursive Dynamic Base Surfaces.
Proceedings of the Advances in Informatics, 2005

2004
Planar Development of Free-Form Surfaces: Quality Evaluation and Visual Inspection.
Computing, 2004

Information models of layout constraints for product life-cycle management: a solid-modelling approach.
Comput. Aided Des., 2004

Editorial to special issue: CAD education.
Comput. Aided Des., 2004

2002
A Fit-and-Merge Algorithm for Range-Image Segmentation and Model Reconstruction.
J. Comput. Inf. Sci. Eng., 2002

Range-Image segmentation and model reconstruction based on a fit-and-merge strategy.
Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 2002

Information Models of Design Constraints for Collaborative Product Development.
Proceedings of the 2002 Geometric Modeling and Processing (GMP 2002), 2002

2001
Methods of Shape-Preserving Spline Approximation: Boris I. Kvasov World Scientific Publishing Co., Singapore, 2000, 356 pp, ISBN 981-02-4010-4.
Comput. Aided Des., 2001

2000
Informationally-Complete Product Models of Complex Arrangements for Simulation-Based Engineering: Modelling Design Constraints using Virtual Solids.
Eng. Comput., 2000

1999
Planar domain simplification for modeling virtual-solids in plant and machinery layout.
Comput. Aided Des., 1999

1997
Visualization of curvature plots and evaluation of fairness: an analysis of the effect of 'scaling'.
Comput. Aided Geom. Des., 1997

1995
Direct Construction of Polynomial Surfaces from Dense Range Images Through Region Growing.
ACM Trans. Graph., 1995

Convexity-preserving interpolatory parametric splines of non-uniform polynomial degree.
Comput. Aided Geom. Des., 1995

Variable-Order Surface Reconstruction Through Region Growing.
Proceedings of the CAD Systems Development: Tools and Methods [Dagstuhl Seminar, 1995], 1995

1994
Curvature-sign-type boundary conditions in parametric cubic-spline interpolation.
Comput. Aided Geom. Des., 1994

10. Polynomial Splines of Nonuniform Degree: Controlling Convexity and Fairness.
Proceedings of the Designing Fair Curves and Surfaces: Shape Quality in Geometric Modeling and Computer-Aided Design, 1994

1. Approximation with Aesthetic Constraints.
Proceedings of the Designing Fair Curves and Surfaces: Shape Quality in Geometric Modeling and Computer-Aided Design, 1994

1993
A Hybrid Method for Shape-Preserving Interpolation with Curvature-Continuous Quintic Splines.
Proceedings of the Geometric Modelling, Dagstuhl, 1993

1992
Controlling the curvature of a quadratic Bézier curve.
Comput. Aided Geom. Des., 1992

Solid/solid classification operations for recursive spatial decomposition and domain triangulation of solid models.
Comput. Aided Des., 1992

1991
Domain Delaunay tetrahedrization of solid models.
Int. J. Comput. Geom. Appl., 1991

Delaunay triangulation of arbitrarily shaped planar domains.
Comput. Aided Geom. Des., 1991

Domain Delaunay Tetrahedrization of arbitrarily shaped curved polyhedra defined in a solid modeling system.
Proceedings of the first ACM Symposium on Solid Modeling Foundations and CAD/CAM Applications, 1991

1990
Automatic fairing algorithm for B-spline curves.
Comput. Aided Des., 1990

1989
Curvature and the fairness of curves and surfaces.
IEEE Computer Graphics and Applications, 1989

1988
An algorithm for constructing convexity and monotonicity-preserving splines in tension.
Comput. Aided Geom. Des., 1988

1987
Fairing cubic B-spline curves.
Comput. Aided Geom. Des., 1987


  Loading...