Finding an approximate minimum-link visibility path inside a simple polygon (Q672401): Difference between revisions

@@ Property / cites work @@
+Minimal link visibility paths inside a simple polygon
+Normal rank
@@ Property / cites work @@
+Computing the visibility polygon from a convex set and related problems
+Normal rank
@@ Property / cites work @@
+Computing minimum length paths of a given homotopy class
+Normal rank
@@ Property / cites work @@
+Analysis of Christofides' heuristic: some paths are more difficult than cycles
+Normal rank
@@ Property / cites work @@
+Minimum Cuts for Circular-Arc Graphs
@@ Property / cites work: Minimum Cuts for Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for minimum link paths inside a simple polygon
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(95)00072-k
+Normal rank
@@ Property / OpenAlex ID @@
+W1997350911
@@ Property / OpenAlex ID: W1997350911 / rank @@
+Normal rank