Polygonal intersection searching
From MaRDI portal
Cites work
- A Note on Locating a Set of Points in a Planar Subdivision
- A space-optimal solution of general region location
- Algorithms for Reporting and Counting Geometric Intersections
- Comments on “algorithms for reporting and counting geometric intersections”
- Counting and Reporting Intersections of d-Ranges
- Efficient worst-case data structures for range searching
- Finding extreme points in three dimensions and solving the post-office problem in the plane
- Multidimensional Searching Problems
- Multidimensional divide-and-conquer
- New Data Structures for Orthogonal Range Queries
- Plane-sweep algorithms for intersecting geometric figures
- Rectilinear line segment intersection, layered segment trees, and dynamization
Cited in
(14)- Stabbing line segments
- The intersection searching problem for c-oriented polygons
- The power of geometric duality
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Lower bounds on the complexity of simplex range reporting on a pointer machine (extended abstract)
- Dominance for enclosure problems
- Optimal solutions for a class of point retrieval problems
- A polynomial-time algorithm for computing the yolk in fixed dimension
- Simplex range reporting on a pointer machine
- On the number of line separations of a finite set in the plane
- Dominance for enclosure problems
- Simplex Range Searching and Its Variants: A Review
- Fractional cascading. II: Applications
- The power of geometric duality revisited
This page was built for publication: Polygonal intersection searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165007)
