On the angle restricted nearest neighbor problem

On the angle restricted nearest neighbor problem

We present a simple and efficient O( N log 2 N) time divide-and-conquer algorithm for solving the all pairs angle restricted neighbors problem for a set of N sites in the plane under any L p metric, 1 ⩽ p ⩽ ∞. Our method also leads to an O( N log d-1 N) expected time algorithm for the d-dimensional...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1990-03, Vol.34 (2), p.71-76
Hauptverfasser: Wee, Young C., Chaiken, Seth, Willard, Dan E.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Artificial intelligence
Computer science
Computer science
control theory
systems
Exact sciences and technology
geographic nearest neighbor
Information processing
Mathematical models
monotone matrix searching
Pattern recognition. Digital image processing. Computational geometry
Proximity
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a simple and efficient O( N log 2 N) time divide-and-conquer algorithm for solving the all pairs angle restricted neighbors problem for a set of N sites in the plane under any L p metric, 1 ⩽ p ⩽ ∞. Our method also leads to an O( N log d-1 N) expected time algorithm for the d-dimensional all pairs angle restricted neighbors problem, for d ⩾ 2.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(90)90139-O