Hostname: page-component-797576ffbb-bqjwj Total loading time: 0 Render date: 2023-12-11T05:01:30.683Z Has data issue: false Feature Flags: { "corePageComponentGetUserInfoFromSharedSession": true, "coreDisableEcommerce": false, "useRatesEcommerce": true } hasContentIssue false

Triangulations and meshes in computational geometry

Published online by Cambridge University Press:  21 March 2001

Herbert Edelsbrunner
Department of Computer Science, Duke University, Durham, NC 27708 and Raindrop Geomagic, Research Triangle Park, North Carolina, NC 27709, USA


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.

Research Article
© Cambridge University Press 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)