An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194): Difference between revisions

@@ Property / cites work @@
+LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
+Normal rank
@@ Property / cites work @@
+An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
+Normal rank
@@ Property / cites work @@
+COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
+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 @@
+Computing the link center of a simple polygon
@@ Property / cites work: Computing the link center of a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal parallel algorithms for rectilinear link-distance problems
+Normal rank
@@ Property / cites work @@
+On Embedding a Graph in the Grid with the Minimum Number of Bends
+Normal rank