Point placement algorithms for Delaunay triangulation of polygonal domains

DOI10.1007/BF01377180zbMath0938.68866OpenAlexW2090162539MaRDI QIDQ1330781

Lee R. Nackman, Vijay Srinivasan

Publication date: 10 August 1994

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01377180

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Nonobtuse triangulations of PSLGs ⋮ 2D and 3D finite element meshing and remeshing ⋮ A Gabriel-Delaunay triangulation of 2D complex fractured media for multiphase flow simulations

Cites Work

• Unnamed Item
• Unnamed Item
• Bisectors of linearly separable sets
• Generalized Delaunay triangulation for planar graphs
• A sweepline algorithm for Voronoi diagrams
• Constrained Delaunay triangulations
• Delaunay triangulation of arbitrarily shaped planar domains
• Representing stereo data with the Delaunay triangulation
• Delaunay-based representation of surfaces defined over arbitrarily shaped domains
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Maximal Balls of Linearly Separable Sets