Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Triangulations in CGAL (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Proceedings of the sixteenth annual symposium on Computational geometry
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
Proceedings of the sixth ACM symposium on Solid modeling and applications
Feature sensitive surface extraction from volume data
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Reconstruction and representation of 3D objects with radial basis functions
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
Tight cocone: a water-tight surface reconstructor
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Graph-Based Surface Reconstruction Using Structures in Scattered Point Sets
CGI '98 Proceedings of the Computer Graphics International 1998
Multi-level partition of unity implicits
ACM SIGGRAPH 2003 Papers
Edge-sharpener: recovering sharp features in triangulations of non-adaptively re-meshed surfaces
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Regular and non-regular point sets: Properties and reconstruction
Computational Geometry: Theory and Applications
On surface reconstruction: A priority driven approach
Computer-Aided Design
Surface reconstruction from point clouds by transforming the medial scaffold
Computer Vision and Image Understanding
Robust mesh reconstruction from unoriented noisy points
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Technical Section: Orienting unorganized points for surface reconstruction
Computers and Graphics
Advances in Engineering Software
| Hi-index | 0.00 |
This paper presents a new combinatorial approach to surface reconstruction with sharp features. Different from other postprocessing methods, the proposed method provides a systematic way to identify and reconstruct sharp features from unorganized sample points in one integrated reconstruction process. In addition, unlike other approximation methods, the reconstructed triangulated surface is guaranteed to pass through the original sample points. In this paper, the sample points in the sharp regions are defined as characteristic vertices (c-vertices), and their associated poles (c-poles) are used as a "sculptor驴 to extract triangles from a Delaunay structure for the sharp features. But, for smooth surface regions, an efficient region-growing scheme is used for triangle extraction and connection. Since only the c-poles associated with the sharp regions are used to participate in the Delaunay computation with the sample points, the proposed algorithm is adaptive in the sense that, given a sampled object with less sharp features, the triangulation becomes more efficient. To validate the proposed algorithm, some detailed illustrations are given. Experimental results show that it is robust and highly efficient.