Optimal halfspace range reporting in three dimensions
From MaRDI portal
Recommendations
Cited in
(36)- Reporting points in halfspaces
- Fault-tolerant spanners in networks with symmetric directional antennas
- Optimal deterministic shallow cuttings for 3-d dominance ranges
- Dynamic half-space range reporting and its applications
- An efficient sum query algorithm for distance-based locally dominating functions
- Approximate range closest-pair queries
- Dynamic geometric data structures via shallow cuttings
- Range search on tuples of points
- Near-linear algorithms for geometric hitting sets and set covers
- Nearest-neighbor searching under uncertainty. I
- Affine invariants of generalized polygons and matching under affine transformations
- Optimal partition trees
- Random Sampling, Halfspace Range Reporting, and Construction of \lowercase(\le k)-Levels in Three Dimensions
- Spanners for directed transmission graphs
- Simplex Range Searching and Its Variants: A Review
- Approximating the k-Level in Three-Dimensional Plane Arrangements
- scientific article; zbMATH DE number 7559224 (Why is no real title available?)
- Independent range sampling, revisited
- Faster DBScan and HDBscan in low-dimensional Euclidean spaces
- An efficient sum query algorithm for distance-based locally dominating functions
- Faster \textsc{dbscan} and \textsc{hdbscan} in low-dimensional Euclidean spaces
- Limits of local search: quality and efficiency
- Optimal deterministic shallow cuttings for 3D dominance ranges
- Cache-oblivious range reporting with optimal queries requires superlinear space
- Optimal partition trees
- Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
- Reachability problems for transmission graphs
- On approximate range counting and depth
- Reachability problems for transmission graphs
- Four-dimensional dominance range reporting in linear space
- Dynamic data structures for \(k\)-nearest neighbor queries
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
- Approximating densest subgraph in geometric intersection graphs
- Dynamic unit-disk range reporting
- Convexity helps iterated search in 3D
- A general approach for cache-oblivious range reporting and approximate range counting
This page was built for publication: Optimal halfspace range reporting in three dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633824)
