An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741): Difference between revisions

@@ Property / cites work @@
+Visibility and intersection problems in plane geometry
+Normal rank
@@ Property / cites work @@
+The zookeeper route problem
@@ Property / cites work: The zookeeper route problem / rank @@
+Normal rank
@@ Property / cites work @@
+Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
+Normal rank
@@ Property / cites work @@
+Optimal shortest path queries in a simple polygon
@@ Property / cites work: Optimal shortest path queries in a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+A new data structure for shortest path queries in a simple polygon
+Normal rank
@@ Property / cites work @@
+Q5501793
@@ Property / cites work: Q5501793 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945523
@@ Property / cites work: Q4945523 / rank @@
+Normal rank