Connect the Dot: Computing Feed-Links with Minimum Dilation (Q3183440): Difference between revisions

@@ Property / author @@
-Boris Aronov
@@ Property / author: Boris Aronov / rank @@
-Normal rank
@@ Property / author @@
-Marc J. van Kreveld
@@ Property / author: Marc J. van Kreveld / rank @@
-Normal rank
@@ Property / author @@
+Boris Aronov
@@ Property / author: Boris Aronov / rank @@
+Normal rank
@@ Property / author @@
+Marc J. van Kreveld
@@ Property / author: Marc J. van Kreveld / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-03367-4_5
+Normal rank
@@ Property / OpenAlex ID @@
+W2116120992
@@ Property / OpenAlex ID: W2116120992 / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
+Normal rank
@@ Property / cites work @@
+Linear size binary space partitions for uncluttered scenes
+Normal rank
@@ Property / cites work @@
+Realistic input models for geometric algorithms
@@ Property / cites work: Realistic input models for geometric algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The geometric dilation of finite point sets
@@ Property / cites work: The geometric dilation of finite point sets / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
+Normal rank
@@ Property / cites work @@
+Local polyhedra and geometric graphs
@@ Property / cites work: Local polyhedra and geometric graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the best shortcut in a geometric network
@@ Property / cites work: Finding the best shortcut in a geometric network / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+Finding the upper envelope of n line segments in O(n log n) time
+Normal rank
@@ Property / cites work @@
+Q4736844
@@ Property / cites work: Q4736844 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Stretch Factor of Euclidean Graphs
+Normal rank
@@ Property / cites work @@
+Geometric Spanner Networks
@@ Property / cites work: Geometric Spanner Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4325546
@@ Property / cites work: Q4325546 / rank @@
+Normal rank
@@ Property / cites work @@
+Motion planning in environments with low obstacle density
+Normal rank
@@ Property / cites work @@
+On fat partitioning, fat covering and the union size of polygons
+Normal rank
@@ Property / DBLP publication ID @@
+conf/wads/AronovBBKLLSS09
@@ Property / DBLP publication ID: conf/wads/AronovBBKLLSS09 / rank @@
+Normal rank