The following pages link to Point retrieval for polygons (Q3777466):
Displaying 8 items.
- The intersection searching problem for c-oriented polygons (Q751326) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- Extremal polygon containment problems (Q1330463) (← links)
- Polygon queries for convex hulls of points (Q1790963) (← links)
- Simplex range reporting on a pointer machine (Q1917035) (← links)
- Improved algorithms for the point-set embeddability problem for plane 3-trees (Q2905309) (← links)
- New upper bounds for generalized intersection searching problems (Q4645201) (← links)
- Lower bounds on the complexity of simplex range reporting on a pointer machine (Q5204338) (← links)