Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation
From MaRDI portal
Publication:1208536
DOI10.1016/0168-9274(93)90062-VzbMath0767.65099MaRDI QIDQ1208536
Publication date: 16 May 1993
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
52B55: Computational aspects related to convexity
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
32B25: Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions
Cites Work
- Properties of \(n\)-dimensional triangulations
- A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers
- The integrity of geometrical boundaries in the two-dimensional delaunay triangulation
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Geometry-based fully automatic mesh generation and the delaunay triangulation
- Two algorithms for constructing a Delaunay triangulation
- A combined octree/delaunay method for fully automatic 3‐D mesh generation