An incremental algorithm for reconstruction of surfaces of arbitrary codimension
Computational Geometry: Theory and Applications
Towards 3D Point cloud based object maps for household environments
Robotics and Autonomous Systems
Point-based simplification algorithm
WSEAS Transactions on Computer Research
Surface reconstruction from point clouds by transforming the medial scaffold
Computer Vision and Image Understanding
On fast surface reconstruction methods for large and noisy point clouds
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
SMI 2011: Full Paper: Point set silhouettes via local reconstruction
Computers and Graphics
Verification of engineering models based on bipartite graph matching for inspection applications
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Surface creation on unstructured point sets using neural networks
Computer-Aided Design
Self-organizing maps with a time-varying structure
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Abstract. We present a fast and memory efficient algorithm that generates a manifold triangular mesh S with or without boundary passing through a set of unorganized points P \subset R3 with no other additional information. Nothing is assumed about the geometry or topology of the sampled manifold model, except for its reasonable smoothness. The speed of our algorithm is derived from a projection-based approach we use to determine the incident faces on a point. Our algorithm has successfully reconstructed the surfaces of unorganized point clouds of sizes varying from 10,000 to 100,000 in about 3 - 30 seconds on a 250 MHz, R10000 SGI Onyx2. Our technique can be specialized for different kinds of input and applications. For example, our algorithm can be specialized to handle data from height fields like terrain and range scan, even in the presence of noise. We have successfully generated meshes for range scan data of size 900,000 points in less than 40 seconds.