The geodesic farthest-point Voronoi diagram in a simple polygon (Q2309478): Difference between revisions

@@ Property / cites work @@
+A linear-time algorithm for computing the Voronoi diagram of a convex polygon
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for the geodesic center of a simple polygon
+Normal rank
@@ Property / cites work @@
+The furthest-site geodesic Voronoi diagram
@@ Property / cites work: The furthest-site geodesic Voronoi diagram / rank @@
+Normal rank
@@ Property / cites work @@
+Q3787491
@@ Property / cites work: Q3787491 / rank @@
+Normal rank
@@ Property / cites work @@
+Ray shooting in polygons using geodesic triangulations
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple 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 @@
+Concrete and abstract Voronoi diagrams
@@ Property / cites work: Concrete and abstract Voronoi diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Q4525679
@@ Property / cites work: Q4525679 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945516
@@ Property / cites work: Q4945516 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4580129
@@ Property / cites work: Q4580129 / rank @@
+Normal rank
@@ Property / cites work @@
+The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
+Normal rank
@@ Property / cites work @@
+k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
+Normal rank
@@ Property / cites work @@
+Computing the geodesic center of a simple polygon
@@ Property / cites work: Computing the geodesic center of a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+Computing geodesic furthest neighbors in simple polygons
+Normal rank