On the symmetric angle-restricted nearest neighbor problem
From MaRDI portal
Publication:834915
DOI10.1016/j.ipl.2004.07.003zbMath1173.68815OpenAlexW2066727387MaRDI QIDQ834915
Publication date: 27 August 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.07.003
Cites Work
- On the angle restricted nearest neighbor problem
- 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
- Euclidean minimum spanning trees and bichromatic closest pairs
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems