Algorithms and Computation

DOI10.1007/11602613MaRDI QIDQ5897839zbMATH OpenOpenAlexFDO

Authors Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Antoine Vigneron, Herman Haverkort

Publication date 14 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11602613

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Sparse geometric graphs with small dilation
• Algorithms and Computation
• The geometric dilation of finite point sets
• Most finite point sets in the plane have dilation \(>1\)
• Computing minimum dilation spanning trees in geometric graphs

Cited in

(6)

• Beta-skeletons have unbounded dilation
• Sparse topologies with small spectrum size
• Dilation-free graphs in thel1 metric
• Light Euclidean Spanners with Steiner Points
• Algorithms and Computation
• Sparse geometric graphs with small dilation

This page was built for publication: Algorithms and Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897839)