Shape reconstruction with Delaunay complex

H. Edelsbrunner, in:, Springer, 1998, pp. 119–132.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Series Title
LNCS
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.
Publishing Year
Date Published
1998-03-25
Volume
1380
Page
119 - 132
Conference
LATIN: Latin American Symposium on Theoretical Informatics
IST-REx-ID

Cite this

Edelsbrunner H. Shape reconstruction with Delaunay complex. In: Vol 1380. Springer; 1998:119-132. doi:10.1007/BFb0054315
Edelsbrunner, H. (1998). Shape reconstruction with Delaunay complex (Vol. 1380, pp. 119–132). Presented at the LATIN: Latin American Symposium on Theoretical Informatics , Springer. https://doi.org/10.1007/BFb0054315
Edelsbrunner, Herbert. “Shape Reconstruction with Delaunay Complex,” 1380:119–32. Springer, 1998. https://doi.org/10.1007/BFb0054315.
H. Edelsbrunner, “Shape reconstruction with Delaunay complex,” presented at the LATIN: Latin American Symposium on Theoretical Informatics , 1998, vol. 1380, pp. 119–132.
Edelsbrunner H. 1998. Shape reconstruction with Delaunay complex. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 1380. 119–132.
Edelsbrunner, Herbert. Shape Reconstruction with Delaunay Complex. Vol. 1380, Springer, 1998, pp. 119–32, doi:10.1007/BFb0054315.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar