Skip to main content
Conference Proceedings

Shape reconstruction with delaunay complex (Invited paper)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1380 119-132
DOI: 10.1007/bfb0054315
75Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algorithmic solutions proposed in the computer science literature that are based on the Delaunay complex of the points.

Cite

CITATION STYLE

APA

Edelsbrunner, H. (1998). Shape reconstruction with delaunay complex (Invited paper). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1380, pp. 119–132). Springer Verlag. https://doi.org/10.1007/bfb0054315

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