Line arrangements and range search
From MaRDI portal
Publication:1107313
DOI10.1016/0020-0190(88)90213-XzbMATH Open0652.68045OpenAlexW2165886607MaRDI QIDQ1107313FDOQ1107313
Authors: 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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)
Cites Work
- Title not available (Why is that?)
- Optimal Search in Planar Subdivisions
- Title not available (Why is that?)
- Halfspace range search: An algorithmic application of k-sets
- More on k-sets of finite sets in the plane
- Reporting and counting segment intersections
- On the number of line separations of a finite set in the plane
- Constructing Belts in Two-Dimensional Arrangements with Applications
- New upper bounds for neighbor searching
Cited In (14)
- Title not available (Why is that?)
- Finding specified sections of arrangements: 2D results
- Efficient and small representation of line arrangements with applications
- A note on searching line arrangements and applications
- The power of geometric duality
- Linear space data structures for two types of range search
- Implicitly representing arrangements of lines or segments
- Topologically sweeping an arrangement
- On finding ordinary or monochromatic intersection points
- Constructing Belts in Two-Dimensional Arrangements with Applications
- Title not available (Why is that?)
- Zooming by repeated range detection
- Partitioning arrangements of lines. I: An efficient deterministic algorithm
- Partitioning arrangements of lines. II: Applications
This page was built for publication: Line arrangements and range search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107313)
