Please use this identifier to cite or link to this item:
|Title:||Surface reconstruction by layer peeling|
|Source:||Lim, C.-W., Tan, T.-S. (2006). Surface reconstruction by layer peeling. Visual Computer 22 (9-11) : 593-603. ScholarBank@NUS Repository. https://doi.org/10.1007/s00371-006-0048-9|
|Abstract:||Given an input point cloud P in ℛ3, this paper proposes a novel algorithm to identify surface neighbors of each point p P respecting the underlying surface S and then to construct a piecewise linear surface for P. The algorithm utilizes the simple k-nearest neighborhood in constructing local surfaces. It makes use of two concepts: a local convexity criterion to extract a set of surface neighbors for each point, and a global projection test to determine an order for the reconstruction. Our algorithm not only produces a topologically correct surface for well-sampled point sets, but also adapts well to handle under-sampled point sets. Furthermore, the computational cost of the algorithm increases almost linearly in the size of the point cloud. It, thus, scales well to deal with large input point sets.|
|Source Title:||Visual Computer|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 7, 2018
WEB OF SCIENCETM
checked on Jan 30, 2018
checked on Mar 11, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.