Connect the Dot: Computing Feed-Links with Minimum Dilation

DOI10.1007/978-3-642-03367-4_5MaRDI QIDQ3183440zbMATH OpenOpenAlexDBLPWikidataFDO

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

Mathematics Subject Classification ID

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

Recommendations

• Linear time algorithm for optimal feed-link placement
• Dilation-optimal edge deletion in polygonal cycles
• Network farthest-point diagrams
• Computing the link center of a simple polygon
• Dilation-Optimal Edge Deletion in Polygonal Cycles

Cites work

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

Cited in

(2)

• Network farthest-point diagrams
• Linear time algorithm for optimal feed-link placement

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)