Connect the Dot: Computing Feed-Links with Minimum Dilation
DOI10.1007/978-3-642-03367-4_5zbMATH Open1253.68327DBLPconf/wads/AronovBBKLLSS09OpenAlexW2116120992WikidataQ59782323 ScholiaQ59782323MaRDI QIDQ3183440FDOQ3183440
Authors: Kevin Buchin, Maike Buchin, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann, Boris Aronov, Marc Van Kreveld 
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Geometric Spanner Networks
- Title not available (Why is that?)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Finding the upper envelope of n line segments in O(n log n) time
- The geometric dilation of finite point sets
- The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Realistic input models for geometric algorithms
- On fat partitioning, fat covering and the union size of polygons
- Linear size binary space partitions for uncluttered scenes
- Approximating the Stretch Factor of Euclidean Graphs
- Motion planning in environments with low obstacle density
- Title not available (Why is that?)
- Finding the best shortcut in a geometric network
- Local polyhedra and geometric graphs
This page was built for publication: Connect the Dot: Computing Feed-Links with Minimum Dilation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183440)
