A decremental greedy algorithm solves a general class of monotone bottleneck subset problems, giving O(n log n) and O(n^2) algorithms for max-min-angle polygons and polyhedra, and NP-hardness for simple 3D curves.
Title resolution pending
1 Pith paper cite this work, alongside 30 external citations. Polarity classification is still indexing.
1
Pith paper citing it
30
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Decremental Greedy Polygons and Polyhedra Without Sharp Angles
A decremental greedy algorithm solves a general class of monotone bottleneck subset problems, giving O(n log n) and O(n^2) algorithms for max-min-angle polygons and polyhedra, and NP-hardness for simple 3D curves.