Meshless parameterization and surface reconstruction
Computer Aided Geometric Design
Direct Segmentation for Reverse Engineering
CW '02 Proceedings of the First International Symposium on Cyber Worlds (CW'02)
Ridge-valley lines on meshes via implicit surface fitting
ACM SIGGRAPH 2004 Papers
Direct segmentation of algebraic models for reverse engineering
Computing - Geometric modelling dagstuhl 2002
Smooth feature lines on surface meshes
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Detection of closed sharp feature lines in point clouds for reverse engineering applications
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Ridge based curve and surface reconstruction
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Visibility-based feature extraction from discrete models
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Feature detection of triangular meshes based on tensor voting theory
Computer-Aided Design
Illustrating how mechanical assemblies work
ACM SIGGRAPH 2010 papers
C1 continuities detection in triangular meshes
Computer-Aided Design
Computational design of mechanical characters
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Feature line extraction from unorganized noisy point clouds using truncated Fourier series
The Visual Computer: International Journal of Computer Graphics
An adaptive normal estimation method for scanned point clouds with sharp features
Computer-Aided Design
| Hi-index | 0.00 |
The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point cloud that will define the border of the various surface patches. In this paper, we present an algorithm to extract closed sharp feature lines, which is necessary to create such a closed curve network. We use a first order segmentation to extract candidate feature points and process them as a graph to recover the sharp feature lines. To this end, a minimum spanning tree is constructed and afterwards a reconnection procedure closes the lines. The algorithm is fast and gives good results for real-world point sets from industrial applications.