Skip to Main content Skip to Navigation

A Greedy Delaunay Based Surface Reconstruction Algorithm

David Cohen-Steiner 1 Frank Da
1 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : 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.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 7:35:41 PM
Last modification on : Thursday, January 20, 2022 - 4:19:31 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:49:25 PM


  • HAL Id : inria-00072024, version 1



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



Les métriques sont temporairement indisponibles