Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
From MaRDI portal
(Redirected from Publication:1880211)
Recommendations
Cited in
(18)- Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
- Binary Space Partitions of Orthogonal Subdivisions
- Binary plane partitions for disjoint line segments
- An improved algorithm for Klee's measure problem on fat boxes
- Cuttings for disks and axis-aligned rectangles in three-space
- On constant factors in comparison-based geometric algorithms and data structures
- A (slightly) faster algorithm for Klee's measure problem
- Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
- On the optimal binary plane partition for sets of isothetic rectangles
- scientific article; zbMATH DE number 2119698 (Why is no real title available?)
- Decomposing the complement of the union of cubes and boxes in three dimensions
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions
- Binary space partition for orthogonal fat rectangles
- Exact size of binary space partitionings and improved rectangle tiling algorithms
- Faster algorithms for largest empty rectangles and boxes
- Binary Space Partitions for Axis-Aligned Fat Rectangles
- Optimal binary space partitions for orthogonal objects
- Binary Space Partitions for Line Segments with a Limited Number of Directions
This page was built for publication: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1880211)
