An O(n log n) algorithm for computing a link center in a simple polygon (Q5096146): Difference between revisions

@@ Property / author @@
+Andrzej Lingas
@@ Property / author: Andrzej Lingas / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3796779
@@ Property / cites work: Q3796779 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+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 @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / 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
@@ Property / cites work @@
+Q3787487
@@ Property / cites work: Q3787487 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for minimum link paths inside a simple polygon
+Normal rank
@@ Property / cites work @@
+Shortest path solves edge-to-edge visibility in a polygon
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bfb0028976
+Normal rank
@@ Property / OpenAlex ID @@
+W1509231325
@@ Property / OpenAlex ID: W1509231325 / rank @@
+Normal rank