Skip to Main content Skip to Navigation

Delaunay Triangulation Based Surface Reconstruction: Ideas and Algorithms

Frédéric Cazals 1 Joachim Giesen
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Given a finite sampling $P\subset\mathbbR^d$ of an unknown surface $S$, surface reconstruction is concerned with the calculation of a model of $S$ from $P$. The model can be represented as a smooth or a triangulated surface, and is expected to match $S$ from a topological and geometric standpoints. In this survey, we focus on the recent developments of Delaunay based surface reconstruction methods, which were the first methods (and in a sense still the only ones) for which one can precisely state properties of the reconstructed surface. We outline the foundations of these methods from a geometric and algorithmic standpoints. In particular, a careful presentation of the hypothesis used by these algorithms sheds light on the intrinsic difficulties of the surface reconstruction problem faced by any method, Delaunay based or not.
Complete list of metadatas

Cited literature [1 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 9:00:40 PM
Last modification on : Saturday, January 27, 2018 - 1:30:59 AM
Document(s) archivé(s) le : Sunday, April 4, 2010 - 9:34:30 PM


  • HAL Id : inria-00070610, version 1



Frédéric Cazals, Joachim Giesen. Delaunay Triangulation Based Surface Reconstruction: Ideas and Algorithms. RR-5393, INRIA. 2004, pp.42. ⟨inria-00070610⟩



Record views


Files downloads