Keywords
Delaunay triangulationBowyer–Watson algorithmConstrained Delaunay triangulationRuppert's algorithmChew's second algorithmAlgorithmPolygon meshPitteway triangulationTriangulationMinimum-weight triangulationMesh generationComputer scienceMathematicsSurface triangulationTopology (electrical circuits)GeometryCombinatoricsFinite 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...
A computational geometric approach to feasible region division in constrained global optimization
Proposes the use of the Delaunay triangulation for feasible region division in constrained global optimization. The mathematical foundations for its use, along with the practica...
Publication Info
- Year
- 1993
- Type
- article
- Volume
- 106
- Issue
- 1
- Pages
- 125-138
- Citations
- 322
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
322
OpenAlex
Cite This
S Rebay
(1993).
Efficient Unstructured Mesh Generation by Means of Delaunay Triangulation and Bowyer-Watson Algorithm.
Journal of Computational Physics
, 106
(1)
, 125-138.
https://doi.org/10.1006/jcph.1993.1097
Identifiers
- DOI
- 10.1006/jcph.1993.1097