Efficient computation of the geodesic Voronoi diagram of points in a simple polygon (Q6102304): Difference between revisions

@@ Property / cites work @@
+On the geodesic Voronoi diagram of point sites in a simple polygon
+Normal rank
@@ Property / cites work @@
+Q3787490
@@ Property / cites work: Q3787490 / rank @@
+Normal rank
@@ Property / cites work @@
+Constrained Delaunay triangulations
@@ Property / cites work: Constrained Delaunay triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+A sweepline algorithm for Voronoi diagrams
@@ Property / cites work: A sweepline algorithm for Voronoi diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+Optimal Search in Planar Subdivisions
@@ Property / cites work: Optimal Search in Planar Subdivisions / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Delaunay triangulation for planar graphs
+Normal rank
@@ Property / cites work @@
+Euclidean shortest paths in the presence of rectilinear barriers
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6102304