Binary Space Partitions for Line Segments with a Limited Number of Directions

DOI10.1137/S0097539702403785zbMath1073.68093OpenAlexW1976012877MaRDI QIDQ4706194

Csaba D. Tóth

Publication date: 19 June 2003

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539702403785

zbMATH Keywords

computational geometryline segmentsbinary space partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (3)

Combinatorics of intervals in the plane. I: Trapezoids ⋮ Binary plane partitions for disjoint line segments ⋮ Approximate range searching using binary space partitions

This page was built for publication: Binary Space Partitions for Line Segments with a Limited Number of Directions