The following pages link to Optimal partition trees (Q420575):
Displaying 24 items.
- Approximating majority depth (Q364853) (← links)
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points (Q680145) (← links)
- Approximation algorithms for the unit disk cover problem in 2D and 3D (Q680146) (← links)
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
- Reprint of: Approximating majority depth (Q906835) (← links)
- Semi-group range sum revisited: query-space lower bound tightened (Q1751095) (← links)
- On the power of the semi-separated pair decomposition (Q1947974) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Window queries for intersecting objects, maximal points and approximations using coresets (Q2235286) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Multilevel polynomial partitions and simplified range searching (Q2354673) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- (Q5088951) (← links)
- (Q5088989) (← links)
- (Q5089169) (← links)
- (Q5111687) (← links)
- Partial Enclosure Range Searching (Q5234042) (← links)
- (Q5881548) (← links)
- Range closest-pair search in higher dimensions (Q5896868) (← links)
- On reverse shortest paths in geometric proximity graphs (Q6092309) (← links)
