On the angle restricted nearest neighbor problem

DOI10.1016/0020-0190(90)90139-OzbMath0695.68047MaRDI QIDQ910232

Dan E. Willard, Seth Chaiken, Young C. Wee

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

proximitydivide-and-conquergeographic nearest neighbormonotone matrix searching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items

On the symmetric angle-restricted nearest neighbor problem, A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• On computing all north-east nearest neighbors in the \(L_ 1\) metric
• The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
• Geometric applications of a matrix-searching algorithm
• A linear time algorithm for finding all farthest neighbors in a convex polygon
• Sorting helps for Voronoi diagrams
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear Programming in Linear Time When the Dimension Is Fixed
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• On Finding the Maxima of a Set of Vectors
• On the Average Number of Maxima in a Set of Vectors and Applications