Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation

DOI10.1016/0168-9274(93)90062-VzbMath0767.65099OpenAlexW2080632690MaRDI QIDQ1208536

S. Singh

Publication date: 16 May 1993

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(93)90062-v

zbMATH Keywords

algorithmsconvex hullDelaunay triangulationspolygonsiterative triangulation algorithm

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25)

Related Items (1)

Three-dimensional unstructured mesh generation. III: Volume meshes

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

This page was built for publication: Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation