Improved upper bound on the stretch factor of delaunay triangulations
From MaRDI portal
Publication:5404432
DOI10.1145/1998196.1998235zbMath1283.68381OpenAlexW2084271299MaRDI QIDQ5404432
Publication date: 24 March 2014
Published in: Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1998196.1998235
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
On plane geometric spanners: a survey and open problems ⋮ Improved routing on the Delaunay triangulation ⋮ Sunflower hard disk graphs ⋮ On path-greedy geometric spanners ⋮ Unnamed Item ⋮ On bounded degree plane strong geometric spanners ⋮ Unnamed Item ⋮ Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs ⋮ Efficiently navigating a random Delaunay triangulation ⋮ Local geometric spanners
This page was built for publication: Improved upper bound on the stretch factor of delaunay triangulations