Delaunay surface reconstruction from scattered points

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The use of three-dimensional digitizers in computer vision and CAD systems produces an object description consisting of a collection of scattered points in R3. In order to obtain a representation of the objects'surface it is necessary to establish a procedure that allows the recovering of their continuity, lost during the data acquisition process. A full automatic O(n2) algorithm is presented. Such algorithm obtains surface representations of free genus objects described from a set of points that belong to the original surface of the object. The only information available about each point is its position in ℝ3. The achieved surface is a Delaunay triangulation of the initial cloud of points. The algorithm has been successfully applied to three-dimensional data proceeding from synthetic and real free shape objects. copy; Springer-Verlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

Rodríguez, A., Espadero, J. M., López, D., & Pastor, L. (2000). Delaunay surface reconstruction from scattered points. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1953 LNCS, pp. 272–283). Springer Verlag. https://doi.org/10.1007/3-540-44438-6_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free