Pages that link to "Item:Q1115187"
From MaRDI portal
The following pages link to An O(n log n) algorithm for the all-nearest-neighbors problem (Q1115187):
Displaying 44 items.
- A taxonomy for nearest neighbour queries in spatial databases (Q394323) (← links)
- Minimizing interference in ad hoc networks with bounded communication radius (Q456109) (← links)
- Dispersion in disks (Q693055) (← links)
- Efficient approximation algorithms for clustering point-sets (Q733558) (← links)
- Multidimensional phase recovery and interpolative decomposition butterfly factorization (Q776691) (← links)
- Minimum dilation stars (Q871060) (← links)
- Ramsey partitions and proximity data structures (Q997827) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- An all-round sweep algorithm for 2-dimensional nearest-neighbor problems (Q1203723) (← links)
- Approximate closest-point queries in high dimensions (Q1209329) (← links)
- Approximating Euclidean distances by small degree graphs (Q1317879) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- An optimal algorithm for the on-line closest-pair problem (Q1330783) (← links)
- On nearest-neighbor graphs (Q1355198) (← links)
- Computing farthest neighbors on a convex polytope. (Q1401257) (← links)
- Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences (Q1575559) (← links)
- Chromatic nearest neighbor searching: A query sensitive approach (Q1595399) (← links)
- Approximate range searching (Q1595401) (← links)
- Kinetic \(k\)-semi-Yao graph and its applications (Q1622343) (← links)
- A sparse graph almost as good as the complete graph on points in \(k\) dimensions (Q1814131) (← links)
- Extending range queries and nearest neighbors (Q1841241) (← links)
- Algorithms for proximity problems in higher dimensions (Q1917037) (← links)
- An approach to adaptive refinement for the RBF-FD method for 2D elliptic equations (Q2143080) (← links)
- Sigma-local graphs (Q2266933) (← links)
- Diffusion polynomial frames on metric measure spaces (Q2425384) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
- Attributed relational graph matching based on the nested assignment structure (Q2654263) (← links)
- An adaptive well-balanced positivity preserving central-upwind scheme on quadtree grids for shallow water equations (Q2664057) (← links)
- On Some Proximity Problems of Colored Sets (Q2867120) (← links)
- Kinetic Reverse k-Nearest Neighbor Problem (Q2946067) (← links)
- REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION (Q2999092) (← links)
- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension (Q3644728) (← links)
- Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation (Q4389263) (← links)
- A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs (Q4557732) (← links)
- ON ENUMERATING AND SELECTING DISTANCES (Q4682169) (← links)
- MIXED SPANNING TREES IN THEORY AND PRACTICE (Q4949992) (← links)
- Approximate $k$-Nearest Neighbor Graph on Moving Points (Q5045992) (← links)
- Selection in monotone matrices and computing k th nearest neighbors (Q5056162) (← links)
- A dynamic separator algorithm (Q5060105) (← links)
- A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects (Q5060127) (← links)
- Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces (Q5136243) (← links)
- Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces (Q5234039) (← links)
