On the angle restricted nearest neighbor problem
From MaRDI portal
Recommendations
- On the symmetric angle-restricted nearest neighbor problem
- An O(n log n) algorithm for the all-nearest-neighbors problem
- scientific article; zbMATH DE number 4074476
- A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects
- Nearest neighbor queries in metric spaces
Cites work
- scientific article; zbMATH DE number 3911704 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- A linear time algorithm for finding all farthest neighbors in a convex polygon
- Geometric applications of a matrix-searching algorithm
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Multidimensional divide-and-conquer
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- On Finding the Maxima of a Set of Vectors
- On computing all north-east nearest neighbors in the \(L_ 1\) metric
- On the Average Number of Maxima in a Set of Vectors and Applications
- Sorting helps for Voronoi diagrams
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
Cited in
(2)
This page was built for publication: On the angle restricted nearest neighbor problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910232)
