The following pages link to Reporting points in halfspaces (Q1196295):
Displaying 50 items.
- Optimal partition trees (Q420575) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets (Q527442) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Two proofs for shallow packings (Q728497) (← links)
- Kinetic sorting and kinetic convex hulls (Q871059) (← links)
- A general approach for cache-oblivious range reporting and approximate range counting (Q991183) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- On range searching with semialgebraic sets (Q1329188) (← links)
- On lines missing polyhedral sets in 3-space (Q1334933) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- Optimal deterministic shallow cuttings for 3-d dominance ranges (Q1755735) (← links)
- Ray shooting and stone throwing with near-linear storage (Q1776898) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Approximate range searching: The absolute model (Q2269144) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Nearest-neighbor searching under uncertainty. I (Q2411831) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max (Q3448818) (← links)
- On Dominance Reporting in 3D (Q3541072) (← links)
- Approximate Polytope Membership Queries (Q4600697) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- ON ENUMERATING AND SELECTING DISTANCES (Q4682169) (← links)
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS (Q4818546) (← links)
- Tight lower bounds for the size of epsilon-nets (Q4924064) (← links)
- Topology B-trees and their applications (Q5057450) (← links)
- Algorithms for polytope covering and approximation (Q5060117) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- (Q5088951) (← links)
- (Q5091119) (← links)
- (Q5091247) (← links)
- (Q5111686) (← links)
- (Q5115770) (← links)
- Economical Delone Sets for Approximating Convex Bodies (Q5116467) (← links)
- Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces (Q5136243) (← links)
- On nearest-neighbor graphs (Q5204336) (← links)
- Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces (Q5234039) (← links)
