Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
On surface normal and Gaussian curvature approximations given data sampled from a smooth surface
Computer Aided Geometric Design
ACM Computing Surveys (CSUR)
Pointshop 3D: an interactive system for point-based surface editing
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Proceedings of the conference on Visualization '01
Efficient simplification of point-sampled surfaces
Proceedings of the conference on Visualization '02
Controlled Topology Simplification
IEEE Transactions on Visualization and Computer Graphics
Computing and Rendering Point Set Surfaces
IEEE Transactions on Visualization and Computer Graphics
Modeling and Rendering of Points with Local Geometry
IEEE Transactions on Visualization and Computer Graphics
Superfaces: Polygonal Mesh Simplification with Bounded Error
IEEE Computer Graphics and Applications
Perturbations and vertex removal in a 3D delaunay triangulation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Progressive point set surfaces
ACM Transactions on Graphics (TOG)
ACM SIGGRAPH 2004 Papers
Registration of point cloud data from a geometric optimization perspective
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
On the normal vector estimation for point cloud data from smooth surfaces
Computer-Aided Design
Computational Geometry: Theory and Applications
ASM: An adaptive simplification method for 3D point-based models
Computer-Aided Design
Hi-index | 0.00 |
This paper presents a new method for point cloud simplification. The method searches for a subset of the original point cloud data such that the maximum geometric deviation between the original and simplified data sets is below a specified error bound. The underlying principle of the simplification process is to partition the original data set into piecewise point clusters and represent each cluster by a single point. By iteratively updating the partition and efficiently evaluating the resulting geometric deviations, the proposed method is able to yield a simplified point cloud that satisfies the error bound constraint and contains near minimum number of data points.