Angle-monotonicity of Delaunay triangulation

DOI10.1016/j.comgeo.2020.101711zbMath1470.68233OpenAlexW3091718692MaRDI QIDQ827337

Mohammad Farshi, Davood Bakhshesh

Publication date: 7 January 2021

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2020.101711

zbMATH Keywords

Delaunay triangulation\(t\)-spannerstretch factorangle-monotone path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

On the plane angle-monotone graphs

Cites Work

• Unnamed Item
• Some results on greedy embeddings in metric spaces
• (Weakly) self-approaching geometric graphs and spanners
• Euclidean Greedy Drawings of Trees
• The Stretch Factor of the Delaunay Triangulation Is Less than 1.998
• Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition
• Geometric Spanner Networks
• Succinct Greedy Geometric Routing in the Euclidean Plane
• Self-approaching curves
• Curves with increasing chords
• On planar greedy drawings of 3-connected planar graphs
• Self-approaching Graphs
• Construction and Local Routing for Angle-Monotone Graphs
• Increasing-Chord Graphs On Point Sets
• An Algorithm to Construct Greedy Drawings of Triangulations
• Increasing-Chord Graphs On Point Sets
• Improved stretch factor of Delaunay triangulations of points in convex position

This page was built for publication: Angle-monotonicity of Delaunay triangulation