Intersection queries in sets of disks
From MaRDI portal
Recommendations
Cites work
- -nets and simplex range queries
- Fractional cascading. I: A data structuring technique
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Optimal Point Location in a Monotone Subdivision
- Quasi-optimal range searching in spaces of finite VC-dimension
- Searching and storing similar lists
- Space searching for intersecting objects
- Storing line segments in partition trees
- Visibility and intersection problems in plane geometry
Cited in
(7)- Intersection queries in sets of disks
- Lower bounds for set intersection queries
- Finding the largest disk containing a query point in logarithmic time with linear storage
- Intersection Queries in Curved Objects
- Finding the largest disk containing a query point in logarithmic time with linear storage (extended abstract)
- On intersection searching problems involving curved objects
- Unit-disk range searching and applications
This page was built for publication: Intersection queries in sets of disks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056120)