Sharp bounds for vertical decompositions of linear arrangements in four dimensions

DOI10.1007/s00454-003-2871-3zbMath1065.52019OpenAlexW2013614394MaRDI QIDQ701796

Vladlen Koltun

Publication date: 16 December 2004

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-003-2871-3

zbMATH Keywords

complexityarrangementvertical decomposition

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial complexity of geometric structures (52C45)

Related Items (5)

Cuttings for disks and axis-aligned rectangles in three-space ⋮ Polynomial Data Structure Lower Bounds in the Group Model ⋮ A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model ⋮ Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location ⋮ Simplex Range Searching and Its Variants: A Review

This page was built for publication: Sharp bounds for vertical decompositions of linear arrangements in four dimensions