A Randomized Algorithm for Closest-Point Queries
From MaRDI portal
Recommendations
Cited in
(55)- On overlays and minimization diagrams
- Cutting hyperplane arrangements
- Euclidean minimum spanning trees and bichromatic closest pairs
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- Relative neighborhood graphs in three dimensions
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Cutting hyperplanes for divide-and-conquer
- An optimal convex hull algorithm in any fixed dimension
- On range searching with semialgebraic sets
- Point location among hyperplanes and unidirectional ray-shooting
- The probabilistic method yields deterministic parallel algorithms
- Chromatic nearest neighbor searching: A query sensitive approach
- On approximate nearest neighbors under \(l_\infty\) norm
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings
- A note concerning the closest point pair algorithm.
- A simple randomized sieve algorithm for the closest-pair problem
- Dynamic half-space range reporting and its applications
- Vertical decomposition of arrangements of hyperplanes in four dimensions
- Vertical decompositions for triangles in 3-space
- Point location in zones of \(k\)-flats in arrangements
- The exact fitting problem in higher dimensions
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Sparse convex hull coverage
- Conic nearest neighbor queries and approximate Voronoi diagrams
- Ray shooting on triangles in 3-space
- A new coding-based algorithm for finding closest pair of vectors
- On reporting the \(L_1\) metric closest pair in a query rectangle
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions
- Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
- A polynomial regularity lemma for semialgebraic hypergraphs and its applications in geometry and property testing
- Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions
- scientific article; zbMATH DE number 437555 (Why is no real title available?)
- POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS
- Optimal partition trees
- Randomized Data Structures for the Dynamic Closest-Pair Problem
- Simplex Range Searching and Its Variants: A Review
- One-sided epsilon-approximants
- Computing optimal \(\varepsilon\)-nets is as easy as finding an unhit set
- scientific article; zbMATH DE number 7561744 (Why is no real title available?)
- Closest pair and the post office problem for stochastic points
- Computing hereditary convex structures
- Approximating Minimization Diagrams and Generalized Proximity Search
- Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
- Hitting sets when the shallow cell complexity is small
- Randomized quickhull
- On ray shooting in convex polytopes
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
- Hopcroft's problem, log* shaving, two-dimensional fractional cascading, and decision trees
- A deterministic view of random sampling and its use in geometry
- A strong lower bound for approximate nearest neighbor searching
- Approximating nearest neighbor among triangles in convex position
This page was built for publication: A Randomized Algorithm for Closest-Point Queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796754)
