2010•Unpublished venueRequires access

Approximate Nearest Neighbor Queries among Parallel Segments

Ioannis Z. Emiris, Theocharis Malamatos, Elias Tsigaridas

Abstract

We develop a data structure for answering efficiently approximate nearest neighbor queries over a set of parallel segments in three dimensions. We connect this problem to approximate nearest neighbor searching under weight constraints and approximate nearest neighbor searching on historical data in any dimension and we give efficient solutions for these as well. 1

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Best bin first, Nearest neighbor search, k-nearest neighbors algorithm, Nearest neighbor graph, Nearest-neighbor chain algorithm, Fixed-radius near neighbors, Cover tree, Large margin nearest neighbor