Abstract
Abstract The Delaunay triangulation has recently received attention as a viable method for construction computational meshes. However, an arbitrary boundary definition which must be preserved in the triangulation process will not, in general, satisfy the geometrical definition on which the Delaunay construction is founded. The effect of this is that the integrity of the given boundary edges will be violated and the computational mesh will not conform to the applied geometrical shape. A method is proposed whereby boundary data are supplemented with points to ensure that imposed boundary edges are preserved during the Delaunay triangulation. The method is illustrated on a geometry of an estuary which exhibits highly complex geometrical features.
Keywords
Related Publications
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
- 1990
- Type
- article
- Volume
- 6
- Issue
- 2
- Pages
- 101-109
- Citations
- 42
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1002/cnm.1630060206