Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles

DOI10.1007/s00454-003-0729-3zbMath1065.68101OpenAlexW1998402272MaRDI QIDQ1880211

Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir

Publication date: 22 September 2004

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

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Cuttings for disks and axis-aligned rectangles in three-space ⋮ An improved algorithm for Klee's measure problem on fat boxes ⋮ Faster algorithms for largest empty rectangles and boxes ⋮ Binary plane partitions for disjoint line segments ⋮ An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions ⋮ A (slightly) faster algorithm for Klee's measure problem ⋮ On constant factors in comparison-based geometric algorithms and data structures

This page was built for publication: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles