Algorithms and Computation

DOI10.1007/11602613zbMath1173.68603OpenAlexW2304246803MaRDI QIDQ5897835

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

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 boundplane graphgeometric networkstretch 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)

Related Items (1)

On the density of iterated line segment intersections

This page was built for publication: Algorithms and Computation