Robustness Issues in Surface Reconstruction

Authors:
Tamal K. Dey;Joachim Giesen;Wulue Zhao
Affiliations:
-;-;-
Venue:
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Year:
2001

Citing 2
Cited 2

A simple algorithm for homeomorphic surface reconstruction

Proceedings of the sixteenth annual symposium on Computational geometry
Detecting undersampling in surface reconstruction

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry

Delaunay based shape reconstruction from large data

PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
Improvements to surface reconstruction by the CRUST algorithm

SCCG '03 Proceedings of the 19th spring conference on Computer graphics

Quantified Score

Hi-index	0.00

Visualization

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.