Computing external farthest neighbors for a simple polygon (Q1175781): Difference between revisions

@@ Property / cites work @@
+Finding the convex hull of a simple polygon
@@ Property / cites work: Finding the convex hull of a simple polygon / rank @@
+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 @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+Euclidean shortest paths in the presence of rectilinear barriers
+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 the external geodesic diameter of a simple polygon
+Normal rank
@@ Property / cites work @@
+Worst-case data structures for the priority queue with attrition
+Normal rank
@@ Property / cites work @@
+Computing geodesic furthest neighbors in simple polygons
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(91)90063-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1977902399
@@ Property / OpenAlex ID: W1977902399 / rank @@
+Normal rank