The following pages link to Polygonal intersection searching (Q1165007):
Displaying 12 items.
- A polynomial-time algorithm for computing the yolk in fixed dimension (Q687092) (← links)
- The intersection searching problem for c-oriented polygons (Q751326) (← links)
- Optimal solutions for a class of point retrieval problems (Q1062772) (← links)
- The power of geometric duality revisited (Q1068550) (← links)
- The power of geometric duality (Q1082821) (← links)
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time (Q1097038) (← links)
- Fractional cascading. II: Applications (Q1099958) (← links)
- Stabbing line segments (Q1163869) (← links)
- On the number of line separations of a finite set in the plane (Q1821352) (← links)
- Simplex range reporting on a pointer machine (Q1917035) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Lower bounds on the complexity of simplex range reporting on a pointer machine (Q5204338) (← links)
