Connect the Dot: Computing Feed-Links with Minimum Dilation

DOI10.1007/978-3-642-03367-4_5zbMath1253.68327OpenAlexW2116120992WikidataQ59782323 ScholiaQ59782323MaRDI QIDQ3183440

Jun Luo, Rodrigo I. Silveira, Maarten Löffler, Bettina Speckmann, Maike Buchin, Kevin Buchin, Marc J. van Kreveld, Boris Aronov

Publication date: 20 October 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_5

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Motion planning in environments with low obstacle density
• On fat partitioning, fat covering and the union size of polygons
• Linear size binary space partitions for uncluttered scenes
• Local polyhedra and geometric graphs
• Realistic input models for geometric algorithms
• The geometric dilation of finite point sets
• Geometric Spanner Networks
• Approximating the Stretch Factor of Euclidean Graphs
• The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
• Finding the best shortcut in a geometric network