Keywords
Delaunay triangulationChew's second algorithmBowyer–Watson algorithmConstrained Delaunay triangulationRuppert's algorithmPitteway triangulationMesh generationSurface triangulationRobustness (evolution)Computer scienceAlgorithmMinimum-weight triangulationMathematical optimizationMathematicsTopology (electrical circuits)CombinatoricsEngineeringFinite element method
Affiliated Institutions
Related Publications
The integrity of geometrical boundaries in the two‐dimensional delaunay triangulation
Abstract The Delaunay triangulation has recently received attention as a viable method for construction computational meshes. However, an arbitrary boundary definition which mus...
Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
The Delaunay tessellation in n-dimensional space is a space-filling aggregate of n-simplices. These n-simplices are the dual forms of the vertices in the commonly used Voronoi t...
Efficient visualization of high‐order finite elements
Abstract A general method for the post‐processing treatment of high‐order finite element fields is presented. The method applies to general polynomial fields, including disconti...
Publication Info
- Year
- 1996
- Type
- book-chapter
- Pages
- 203-222
- Citations
- 2100
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2100
OpenAlex
Cite This
Jonathan Richard Shewchuk
(1996).
Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator.
Lecture notes in computer science
, 203-222.
https://doi.org/10.1007/bfb0014497
Identifiers
- DOI
- 10.1007/bfb0014497