Surface reconstruction by layer peeling
Surface reconstruction by layer peeling
复制标题
DOI：
10.1007/s00371-006-0048-9
复制
发表时间：
2006-09
期刊：
影响因子：
--
通讯作者：
Chi-Wan Lim;T. Tan
中科院分区：
文献类型：
--
作者：
Chi-Wan Lim;T. Tan
在给定ℜ3的输入点CloudPin 3的情况下，提出了一种新的算法来识别每个点∈P与下垫面S的曲面邻域，进而构造P的分段线性曲面。该算法利用单纯最近邻域来构造局部曲面。它利用两个概念：局部凸性准则来提取每个点的一组曲面邻域，以及全局投影检验来确定重建的顺序。我们的算法不仅为高采样点集生成了一个拓扑正确的曲面，而且还很好地适应于处理欠采样点集。此外，算法的计算成本几乎随着点云大小的增加而线性增加。因此，它可以很好地扩展以处理较大的输入点集。
Given an input point cloudPin ℜ3, this paper proposes a novel algorithm to identify surface neighbors of each pointp∈Prespecting the underlying surfaceSand then to construct a piecewise linear surface forP. The algorithm utilizes the simplek-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.