Robustness issues in surface reconstruction

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

This article is free to access.

Abstract

The piecewise linear reconstruction of a surface from a sample is a well studied problem in computer graphics and computational geometry. A popular class of reconstruction algorithms filter a subset of triangles of the three dimensional Delaunay triangulation of the sample and subsequently extract a manifold from the filtered triangles. Here we report on robustness issues that turned out to be crucial in implementations.

Cite

CITATION STYLE

APA

Dey, T. K., Giesen, J., & Zhao, W. (2001). Robustness issues in surface reconstruction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2073, pp. 658–662). Springer Verlag. https://doi.org/10.1007/3-540-45545-0_76

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