O(n log n) algorithm and matching Omega(n log n) lower bound for partitioning a simple polygon's boundary into the minimum number of contiguous visible segments.
[MS04] Joseph S
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CG 2verdicts
UNVERDICTED 2representative citing papers
Subquadratic Õ(n^{2-1/48}) algorithm for shortest tours of disjoint orthogonal polygons, plus linear-time results for ortho-convex and rectangular cases.
citing papers explorer
-
Touring a Sequence of Orthogonal Polygons
Subquadratic Õ(n^{2-1/48}) algorithm for shortest tours of disjoint orthogonal polygons, plus linear-time results for ortho-convex and rectangular cases.