Pages that link to "Item:Q751816"
From MaRDI portal
The following pages link to A deterministic view of random sampling and its use in geometry (Q751816):
Displaying 18 items.
- IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS (Q2875643) (← links)
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
- Geometric Hitting Sets for Disks: Theory and Practice (Q3452850) (← links)
- On a Question of Bourgain about Geometric Incidences (Q3527547) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- One-Sided Epsilon-Approximants (Q4604378) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems (Q4604388) (← links)
- Robust Tverberg and Colourful Carathéodory Results via Random Choice (Q4635512) (← links)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS (Q4682170) (← links)
- (Q5009629) (← links)
- Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Q5041732) (← links)
- A survey of mass partitions (Q5067418) (← links)
- On Ray Shooting for Triangles in 3-Space and Related Problems (Q5092511) (← links)
- On range searching with semialgebraic sets (Q5096815) (← links)
- Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications (Q5138781) (← links)
- (Q5381136) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
