Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Delaunay based shape reconstruction from large data
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
Shape dimension and approximation from samples
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
A geometric convection approach of 3-D reconstruction
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
External Memory Management and Simplification of Huge Meshes
IEEE Transactions on Visualization and Computer Graphics
Large Mesh Simplification using Processing Sequences
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Streaming computation of Delaunay triangulations
ACM SIGGRAPH 2006 Papers
Surface reconstruction by layer peeling
The Visual Computer: International Journal of Computer Graphics
Streaming compression of triangle meshes
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Multilevel streaming for out-of-core surface reconstruction
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
A streaming algorithm for surface reconstruction
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Fast low-memory streaming MLS reconstruction of point-sampled surfaces
Proceedings of Graphics Interface 2009
Out-of-core MLS reconstruction
CGIM '07 Proceedings of the Ninth IASTED International Conference on Computer Graphics and Imaging
Streaming surface reconstruction using wavelets
SGP '08 Proceedings of the Symposium on Geometry Processing
| Hi-index | 0.00 |
We present a memory and time efficient surface reconstruction algorithm for large sets of points, without normal information, that may not fit within the main memory. Our algorithm treats the input points as forming layers of surface patches, and then performs reconstruction by working on multiple layers of surface patches concurrently based on an out-of-core octree. Additionally, the memory usage of the algorithm can be pre-estimated through a few simple quantities in relation to the spatial coherence of the input points. Tests on the algorithm with large point sets verify that it produces good outputs too.