Binary space partitions for axis-parallel line segments: Size-height tradeoffs.

DOI10.1016/S0020-0190(02)00284-3zbMath1042.68107OpenAlexW2149634922MaRDI QIDQ1853137

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

zbMATH Keywords

Computational geometryLine segmentsBinary space partitions

Mathematics Subject Classification ID

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

Related Items (1)

Binary plane partitions for disjoint line segments

Cites Work

• Unnamed Item
• Efficient binary space partitions for hidden-surface removal and solid modeling
• On the optimal binary plane partition for sets of isothetic rectangles
• New results on binary space partitions in the plane
• Optimal binary space partitions for orthogonal objects
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
• A note on binary plane partitions

This page was built for publication: Binary space partitions for axis-parallel line segments: Size-height tradeoffs.