Algorithms and Computation

DOI10.1007/11602613MaRDI QIDQ5897835zbMATH OpenOpenAlexFDO

Authors Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas

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

zbMATH Keywords

dilationlower boundgeometric networkplane graphstretch factorspanning ratio

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION
• The geometric dilation of finite point sets
• Algorithms and Computation
• Most finite point sets in the plane have dilation \(>1\)
• Algorithms and Computation

Cited in

(8)

• The geometric dilation of finite point sets
• On the density of iterated line segment intersections
• Kinetic and Stationary Point-Set Embeddability for Plane Graphs
• A divide-and-conquer strategy for embedding a distance-net point set into \(E^ n\) and its application
• Embeddings of small generalized polygons
• EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION
• Algorithms and Computation
• Graphs embedded in the plane with a bounded number of accumulation points

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 Q5897835)