Sharp bounds for vertical decompositions of linear arrangements in four dimensions
From MaRDI portal
Publication:701796
DOI10.1007/s00454-003-2871-3zbMath1065.52019MaRDI QIDQ701796
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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52C35: Arrangements of points, flats, hyperplanes (aspects of discrete geometry)
52C45: Combinatorial complexity of geometric structures
Related Items
Simplex Range Searching and Its Variants: A Review, Polynomial Data Structure Lower Bounds in the Group Model, Cuttings for disks and axis-aligned rectangles in three-space, Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location, A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model