Q5116471 (Q5116471): Difference between revisions

@@ Property / cites work @@
+A linear-time algorithm for the geodesic center of a simple polygon
+Normal rank
@@ Property / cites work @@
+Geodesic order types
@@ Property / cites work: Geodesic order types / rank @@
+Normal rank
@@ Property / cites work @@
+The geodesic diameter of polygonal domains
@@ Property / cites work: The geodesic diameter of polygonal domains / rank @@
+Normal rank
@@ Property / cites work @@
+Querying two boundary points for shortest paths in a polygonal domain
+Normal rank
@@ Property / cites work @@
+Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
+Normal rank
@@ Property / cites work @@
+Geodesic ham-sandwich cuts
@@ Property / cites work: Geodesic ham-sandwich cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting Weakly Simple Polygons
@@ Property / cites work: Detecting Weakly Simple Polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Translating polygons with applications to hidden surface removal
+Normal rank
@@ Property / cites work @@
+SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
@@ Property / cites work: SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing minimum separating polygons
+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 @@
+Matrix Searching with the Shortest-Path Metric
@@ Property / cites work: Matrix Searching with the Shortest-Path Metric / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Euclidean Shortest Paths in the Plane
+Normal rank
@@ Property / cites work @@
+Minimum-link paths among obstacles in the plane
@@ Property / cites work: Minimum-link paths among obstacles in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Almost tight upper bounds for lower envelopes in higher dimensions
+Normal rank
@@ Property / cites work @@
+On the geodesic centers of polygonal domains
@@ Property / cites work: On the geodesic centers of polygonal domains / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
+Normal rank