The geometric dilation of finite point sets

DOI10.1007/S00453-005-1203-9zbMath1092.68106OpenAlexW1998571970MaRDI QIDQ2492632

Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein

Publication date: 14 June 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-005-1203-9

zbMATH Keywords

embedded planar graph

Mathematics Subject Classification ID

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

Related Items (16)

Connect the Dot: Computing Feed-Links with Minimum Dilation ⋮ On plane geometric spanners: a survey and open problems ⋮ On the geometric dilation of closed curves, graphs, and point sets ⋮ Geometric dilation of closed planar curves: New lower bounds ⋮ Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) ⋮ Sparse geometric graphs with small dilation ⋮ Linear time algorithm for optimal feed-link placement ⋮ COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD ⋮ Balls minimize trace constants in BV ⋮ Most finite point sets in the plane have dilation \(>1\) ⋮ Minimum weight convex Steiner partitions ⋮ Quadrisecants give new lower bounds for the ropelength of a knot ⋮ Lattice Spanners of Low Degree ⋮ Lower Bounds on the Dilation of Plane Spanners ⋮ Light orthogonal networks with constant geometric dilation ⋮ Lattice spanners of low degree

This page was built for publication: The geometric dilation of finite point sets