O(log n) value and O(h log(1+n/h)) reporting algorithms for convex polygons, O(n log n) for simple and self-overlapping polygons, with matching lower bounds, via antichain DP in the Clarke-Cormack-Burkowski lattice.
Triangulating a simple polygon in linear time.Discrete & Computational Geometry, 6(3):485–524
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds
O(log n) value and O(h log(1+n/h)) reporting algorithms for convex polygons, O(n log n) for simple and self-overlapping polygons, with matching lower bounds, via antichain DP in the Clarke-Cormack-Burkowski lattice.