GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON (Q4650081): Difference between revisions

@@ Property / cites work @@
+On the geodesic Voronoi diagram of point sites in a simple polygon
+Normal rank
@@ Property / cites work @@
+Ray shooting in polygons using geodesic triangulations
+Normal rank
@@ Property / cites work @@
+Static and Dynamic Algorithms for k-Point Clustering Problems
+Normal rank
@@ Property / cites work @@
+Iterated nearest neighbors and finding minimal polytopes
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+Fast algorithms for computing the smallest \(k\)-enclosing circle
+Normal rank
@@ Property / cites work @@
+Q4148820
@@ Property / cites work: Q4148820 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994557
@@ Property / cites work: Q3994557 / rank @@
+Normal rank
@@ Property / cites work @@
+On enclosing k points by a circle
@@ Property / cites work: On enclosing k points by a circle / rank @@
+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