A Greedy Delaunay Based Surface Reconstruction Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2002

A Greedy Delaunay Based Surface Reconstruction Algorithm

David Cohen-Steiner
  • Function : Author
  • PersonId : 833472
Frank Da
  • Function : Author


In this paper, we present a new greedy algorithm for surface reconstruction from unorganized point sets. Starting from a seed facet, a piecewise linear surface is grown by adding Delaunay triangles one by one. The most plausible triangles are added in the first place, in a way that prevents the appearance of topological singularities. The output is thus guaranteed to be a piecewise linear orientable manifold, possibly with boundary. Experiments show that this method is very fast, and achieves topologically correct reconstruction in most cases. Moreover, it can handle surfaces with complex topology, boundaries, and non uniform sampling.
Fichier principal
Vignette du fichier
RR-4564.pdf (820.8 Ko) Télécharger le fichier

Dates and versions

inria-00072024 , version 1 (23-05-2006)


  • HAL Id : inria-00072024 , version 1


David Cohen-Steiner, Frank Da. A Greedy Delaunay Based Surface Reconstruction Algorithm. RR-4564, INRIA. 2002. ⟨inria-00072024⟩
193 View
2143 Download


Gmail Facebook Twitter LinkedIn More