Sharp bounds for vertical decompositions of linear arrangements in four dimensions

DOI10.1007/S00454-003-2871-3MaRDI QIDQ701796zbMATHOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1830725
• Almost tight upper bounds for vertical decompositions in four dimensions
• Vertical decomposition of arrangements of hyperplanes in four dimensions
• scientific article; zbMATH DE number 2119742
• Cell complexities in hyperplane arrangements

Cited in

(8)

• Almost tight upper bounds for vertical decompositions in four dimensions
• scientific article; zbMATH DE number 1830725 (Why is no real title available?)
• Simplex Range Searching and Its Variants: A Review
• Vertical decomposition of arrangements of hyperplanes in four dimensions
• Polynomial data structure lower bounds in the group model
• Cuttings for disks and axis-aligned rectangles in three-space
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701796)