Binary plane partitions for disjoint line segments

DOI10.1007/s00454-011-9341-0zbMath1222.68402OpenAlexW4235438453MaRDI QIDQ540437

Csaba D. Tóth

Publication date: 3 June 2011

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

Full work available at URL: https://doi.org/10.1007/s00454-011-9341-0

zbMATH Keywords

line segmentbinary space partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE

Cites Work

• Unnamed Item
• Efficient binary space partitions for hidden-surface removal and solid modeling
• Ray shooting in polygons using geodesic triangulations
• New results on binary space partitions in the plane
• A note on binary plane partitions
• Guarding scenes against invasive hypercubes.
• Spanning trees crossing few barriers
• Linear size binary space partitions for uncluttered scenes
• Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
• Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
• Approximate range searching using binary space partitions
• 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
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
• Binary Space Partitions for Fat Rectangles
• Binary Space Partitions of Orthogonal Subdivisions
• Shooting permanent rays among disjoint polygons in the plane

This page was built for publication: Binary plane partitions for disjoint line segments