On the angle restricted nearest neighbor problem
From MaRDI portal
DOI10.1016/0020-0190(90)90139-OzbMATH Open0695.68047MaRDI QIDQ910232FDOQ910232
Authors: Young C. Wee, Seth Chaiken, Dan E. Willard 
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
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
- Multidimensional divide-and-conquer
- Title not available (Why is that?)
- Linear Programming in Linear Time When the Dimension Is Fixed
- On Finding the Maxima of a Set of Vectors
- Title not available (Why is that?)
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Geometric applications of a matrix-searching algorithm
- On the Average Number of Maxima in a Set of Vectors and Applications
- A linear time algorithm for finding all farthest neighbors in a convex polygon
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
- Sorting helps for Voronoi diagrams
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
- On computing all north-east nearest neighbors in the \(L_ 1\) 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)
