Please use this identifier to cite or link to this item:
|Title:||Efficient implementation of point set reconstruction by multi-layer peeling algorithm|
|Citation:||Wang, L., Tan, T.-S., Lim, C.-W., Meng, X.-X., Du, C., Ji, Z.-F. (2011). Efficient implementation of point set reconstruction by multi-layer peeling algorithm. Computers and Graphics (Pergamon) 35 (2) : 208-217. ScholarBank@NUS Repository. https://doi.org/10.1016/j.cag.2010.12.004|
|Abstract:||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. © 2010 Elsevier Ltd. All rights reserved.|
|Source Title:||Computers and Graphics (Pergamon)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 2, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.