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.
Dynamic planar convex hull
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CG 2verdicts
UNVERDICTED 2representative citing papers
Reconstruction of digital convex lattice sets from one X-ray and fat ones from two X-rays is polynomial-time solvable via DAG encoding, with a counterexample disproving a conjecture on HV-convex polyomino aggregation.
citing papers explorer
-
The Contiguous Art Gallery Problem is in {\Theta}(n log n)
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.
-
Reconstruction of Convex Sets from One or Two X-rays
Reconstruction of digital convex lattice sets from one X-ray and fat ones from two X-rays is polynomial-time solvable via DAG encoding, with a counterexample disproving a conjecture on HV-convex polyomino aggregation.