Nearly-tight complexity bounds are derived for vertical decompositions of substructures in 3D and 4D semi-algebraic arrangements, settling several long-standing open problems.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Nearly-Tight Bounds for Vertical Decomposition in Three and Four Dimensions
Nearly-tight complexity bounds are derived for vertical decompositions of substructures in 3D and 4D semi-algebraic arrangements, settling several long-standing open problems.