On computing all north-east nearest neighbors in the \(L_ 1\) metric
From MaRDI portal
Publication:1055197
DOI10.1016/0020-0190(83)90045-5zbMath0521.68079OpenAlexW2026175709MaRDI QIDQ1055197
Jorge Stolfi, Leonidas J. Guibas
Publication date: 1983
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(83)90045-5
computational geometryminimum spanning treenearest neighborpoints in the planefirst quadrantL1 metric
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99)
Related Items
On the symmetric angle-restricted nearest neighbor problem ⋮ The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric ⋮ Low-degree minimum spanning trees ⋮ On the angle restricted nearest neighbor problem ⋮ Stacks, queues, and deques with order-statistic operations ⋮ Chaining algorithms for multiple genome comparison ⋮ Efficient minimum spanning tree construction with Delaynay triangulation
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Finding Minimum Spanning Trees
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
