Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
From MaRDI portal
Publication:1853137
DOI10.1016/S0020-0190(02)00284-3zbMATH Open1042.68107OpenAlexW2149634922MaRDI QIDQ1853137FDOQ1853137
Authors: Sunil Arya
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00284-3
Recommendations
- Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
- Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
- scientific article; zbMATH DE number 2119698
- Binary Space Partitions for Line Segments with a Limited Number of Directions
- Binary Space Partitions for Axis-Aligned Fat Rectangles
- Optimal binary space partitions for segments in the plane
- Linear size binary space partitions for uncluttered scenes
- Optimal binary space partitions for orthogonal objects
- Binary Space Partitions for Fat Rectangles
- Binary space partition for orthogonal fat rectangles
Cites Work
- Title not available (Why is that?)
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- New results on binary space partitions in the plane
- Optimal binary space partitions for orthogonal objects
- Efficient binary space partitions for hidden-surface removal and solid modeling
- On the optimal binary plane partition for sets of isothetic rectangles
- A note on binary plane partitions
- Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
Cited In (3)
This page was built for publication: Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853137)