Name
Title | ||
|---|---|---|
Efficient implementation of point set reconstruction by multi-layer peeling algorithm |
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.cag.2010.12.004 | Computers & Graphics |
Keywords | DocType | Volume |
Surface reconstruction,Layer-peeling,Large data,Octree | Journal | 35 |
Issue | ISSN | Citations |
2 | 0097-8493 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| lu | 1 | 48 | 17.53 |
| Tiow-Seng Tan | 2 | 398 | 27.99 |
| Chi-Wan Lim | 3 | 12 | 2.30 |
| Xiangxu Meng | 4 | 308 | 60.76 |
| Cheng Du | 5 | 0 | 0.34 |
| Zhen-fang Ji | 6 | 0 | 0.34 |