Shape Reconstruction from Unorganized Set of Points
Shape Reconstruction from Unorganized Set of Points
复制标题
DOI:
10.1007/978-3-642-13772-3_28
复制
发表时间:
2010-06
期刊:
影响因子:
--
通讯作者:
Yvan Maillot;Bruno Adam;Mahmoud Melkemi
中科院分区:
文献类型:
--
作者:
Yvan Maillot;Bruno Adam;Mahmoud Melkemi
This paper deals with the problem of reconstructing shapes from an unorganized set of sample points (calledS). First, we give an intuitive notion for gathering sample points in order to reconstruct a shape. Then, we introduce a variant ofα-shape [1] which takes into account that the density of the sample points varies from place to place, depending on the required amount of details. The Locally-Density-Adaptive-α-hull (LDA-α-hull) is formally defined and some nice properties are proven. It generates a monotone family of hulls forαranging from 0 to 1. Afterwards, from LDA-α-hull, we formally define the LDA-α-shape, describing the boundaries of the reconstructed shape, and the LDA-α-complex, describing the shape and its interior. Both describe a monotone family of subgraphs of the Delaunay triangulation ofS(calledDel(S)). That is, forαvarying from 0 to 1, LDA-α-shape (resp. LDA-α-complex) goes from the convex hull ofS(resp.Del(S)) toS. These definitions lead to a very simple and efficient algorithm to compute LDA-α-shape and LDA-α-complex inO(nlog(n)). Finally, a few meaningful examples show how a shape is reconstructed and underline the stability of the reconstruction in a wide range ofαeven if the density of the sample points varies from place to place.