Triangulations and meshes in computational geometry

H. Edelsbrunner, Acta Numerica 9 (2000) 133–213.

Download
No fulltext has been uploaded. References only!
Journal Article | Published
Abstract
The Delaunay triangulation of a finite point set is a central theme in computational geometry. It finds its major application in the generation of meshes used in the simulation of physical processes. This paper connects the predominantly combinatorial work in classical computational geometry with the numerical interest in mesh generation. It focuses on the two- and three-dimensional case and covers results obtained during the twentieth century.
Publishing Year
Date Published
2000-03-21
Journal Title
Acta Numerica
Acknowledgement
Research is partially supported by the Army Research Office under grant DAAG55-98-1-0177 and by the National Science Foundation under grants CCR-96-19542 and CCR-97-12088.
Volume
9
Page
133 - 213
IST-REx-ID

Cite this

Edelsbrunner H. Triangulations and meshes in computational geometry. Acta Numerica. 2000;9:133-213.
Edelsbrunner, H. (2000). Triangulations and meshes in computational geometry. Acta Numerica, 9, 133–213.
Edelsbrunner, Herbert. “Triangulations and Meshes in Computational Geometry.” Acta Numerica 9 (2000): 133–213.
H. Edelsbrunner, “Triangulations and meshes in computational geometry,” Acta Numerica, vol. 9, pp. 133–213, 2000.
Edelsbrunner H. 2000. Triangulations and meshes in computational geometry. Acta Numerica. 9, 133–213.
Edelsbrunner, Herbert. “Triangulations and Meshes in Computational Geometry.” Acta Numerica, vol. 9, Cambridge University Press, 2000, pp. 133–213.

Link(s) to Main File(s)
Access Level
Restricted Closed Access

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar