Line arrangements and range search

DOI10.1016/0020-0190(88)90213-XzbMath0652.68045OpenAlexW2165886607MaRDI QIDQ1107313

Ji{ří} Matoušek

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90213-x

zbMATH Keywords

computational geometryrange searchgeometrical algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• Unnamed Item
• Unnamed Item
• Halfspace range search: An algorithmic application of k-sets
• More on k-sets of finite sets in the plane
• On the number of line separations of a finite set in the plane
• Reporting and counting segment intersections
• New upper bounds for neighbor searching
• Optimal Search in Planar Subdivisions
• Constructing Belts in Two-Dimensional Arrangements with Applications

This page was built for publication: Line arrangements and range search