A dual-space O(n log n) greedy method conservatively simplifies convex hulls to a target number of half-spaces while minimizing added volume or surface area.
I.: Decomposing images into layers via rgb-space geometry.ACM Trans
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Progressive Convex Hull Simplification
A dual-space O(n log n) greedy method conservatively simplifies convex hulls to a target number of half-spaces while minimizing added volume or surface area.