Pages that link to "Item:Q5408758"
From MaRDI portal
The following pages link to On Range Searching with Semialgebraic Sets. II (Q5408758):
Displaying 26 items.
- On the Zarankiewicz problem for intersection hypergraphs (Q272311) (← links)
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
- Almost tight bounds for eliminating depth cycles in three dimensions (Q1745206) (← links)
- On separating points by lines (Q1985301) (← links)
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems (Q2105319) (← links)
- On 3SUM-hard problems in the decision tree model (Q2117780) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Multilevel polynomial partitions and simplified range searching (Q2354673) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Straight-path queries in trajectory data (Q2634714) (← links)
- Few cuts meet many point sets (Q2696278) (← links)
- On a real analog of Bezout inequality and the number of connected components of sign conditions (Q2795904) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications (Q4989918) (← links)
- On the Stretch Factor of Polygonal Chains (Q5001847) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- (Q5088930) (← links)
- (Q5092418) (← links)
- Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications (Q5138781) (← links)
- Representation Complexities of SemiAlgebraic Graphs (Q5237912) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Improved Bounds for Incidences Between Points and Circles (Q5364239) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- On reverse shortest paths in geometric proximity graphs (Q6092309) (← links)
- Dynamic data structures for \(k\)-nearest neighbor queries (Q6101840) (← links)
- On semialgebraic range reporting (Q6145667) (← links)
