Pages that link to "Item:Q1329188"
From MaRDI portal
The following pages link to On range searching with semialgebraic sets (Q1329188):
Displaying 31 items.
- Optimal partition trees (Q420575) (← links)
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
- Linear data structures for fast ray-shooting amidst convex polyhedra (Q834599) (← links)
- Topology and combinatorics of partitions of masses by hyperplanes (Q855777) (← links)
- How to get close to the median shape (Q870425) (← links)
- Separating bichromatic point sets by L-shapes (Q904108) (← links)
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space (Q934024) (← links)
- Ray shooting and stone throwing with near-linear storage (Q1776898) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- On Euclidean vehicle routing with allocation (Q2269139) (← links)
- Approximate range searching in higher dimension (Q2456663) (← links)
- Crossing patterns of semi-algebraic sets (Q2566809) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- All Farthest Neighbors in the Presence of Highways and Obstacles (Q3605486) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- ON ENUMERATING AND SELECTING DISTANCES (Q4682169) (← links)
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications (Q4989918) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- (Q5088951) (← links)
- (Q5088955) (← links)
- On Ray Shooting for Triangles in 3-Space and Related Problems (Q5092511) (← links)
- Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications (Q5138781) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- (Q5881548) (← links)
- Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses (Q5943320) (← links)
- On reverse shortest paths in geometric proximity graphs (Q6092309) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)
