Generalized Delaunay triangulation for planar graphs
From MaRDI portal
Publication:1078807
DOI10.1007/BF02187695zbMath0596.52007MaRDI QIDQ1078807
Publication date: 1986
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130991
52-04: Software, source code, etc. for problems pertaining to convex and discrete geometry
05C10: Planar graphs; geometric and topological aspects of graph theory
52A10: Convex sets in (2) dimensions (including convex curves)
05C99: Graph theory
Related Items
Reliable Delaunay‐based mesh generation and mesh improvement, An upper bound for conforming Delaunay triangulations, A convex polygon among polygonal obstacle: Placement and high-clearance motion, Efficiently updating constrained Delaunay triangulations, Fast algorithms for greedy triangulation, Optimal time bounds for some proximity problems in the plane, Detecting and decomposing self-overlapping curves, Duality of constrained Voronoi diagrams and Delaunay triangulations, Provably good mesh generation, Point placement algorithms for Delaunay triangulation of polygonal domains, A framework for advancing front techniques of finite element mesh generation, Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
