Efficient implementation of point set reconstruction by multi-layer peeling algorithm

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. [Display omitted] ► Memory and time efficient surface reconstruction algorithm for large sets of points. ► Multiple layers surface reconstruction. ► Estimation of the size of the active point sets based on spatial coherence.