Regular and non-regular point sets: properties and reconstruction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computational Geometry Year : 2001

Regular and non-regular point sets: properties and reconstruction


In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants, which are polygonal approximations of curves and surfaces satisfying a new regularity condition. This new condition, which is an extension of the popular notion of $r$-sampling to the practical case of discrete shapes, seems much more realistic than previously proposed conditions based on properties of the underlying continuous shapes. Indeed, contrary to previous sampling criteria, our regularity condition can be checked on the basis of the samples alone and can be turned into a provably correct curve and surface reconstruction algorithm. Our reconstruction methods can also be applied to non-regular and unorganized point sets, revealing a larger part of the inner structure of such point sets than past approaches. Several real-size reconstruction examples validate the new method.
Fichier principal
Vignette du fichier
BoyerPetitjean_cgta01.pdf (2.18 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00100428 , version 1 (26-05-2011)



Sylvain Petitjean, Edmond Boyer. Regular and non-regular point sets: properties and reconstruction. Computational Geometry, 2001, 19 (2-3), pp.101--126. ⟨10.1016/S0925-7721(01)00016-5⟩. ⟨inria-00100428⟩
129 View
143 Download



Gmail Facebook Twitter LinkedIn More