On the stretch factor of convex Delaunay graphs
From MaRDI portal
Publication:2968068
DOI10.20382/jocg.v1i1a4zbMath1404.68184OpenAlexW2568500375MaRDI QIDQ2968068
Paz Carmi, Sébastien Collette, Prosenjit Bose, Michiel H. M. Smid
Publication date: 9 March 2017
Full work available at URL: https://doaj.org/article/22480fce4d6c45c393fc2b105609151e
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Constrained generalized Delaunay graphs are plane spanners, Coloring planar homothets and three-dimensional hypergraphs, Coloring points with respect to squares, Local routing algorithms on Euclidean spanners with small diameter, Strong matching of points with geometric shapes, Higher-order triangular-distance Delaunay graphs: graph-theoretical properties, Construction and Local Routing for Angle-Monotone Graphs, Tight stretch factors for \(L_1\)- and \(L_\infty\)-Delaunay triangulations, On shape Delaunay tessellations, Hamiltonicity for convex shape Delaunay and Gabriel graphs, Fixed-orientation equilateral triangle matching of point sets, Proper coloring of geometric hypergraphs