论文信息 - Approximate Nearest Neighbor Queries among Parallel Segments

Approximate Nearest Neighbor Queries among Parallel Segments

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.

Theocharis Malamatos | Ioannis Z. Emiris | Elias Tsigaridas

[1] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.

[2] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[3] Avner Magen,et al. Dimensionality Reductions in ℓ2 that Preserve Volumes and Distance to Affine Spaces , 2007, Discret. Comput. Geom..

[4] Micha Sharir,et al. Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions , 2002, SCG '02.

[5] Piotr Indyk,et al. Nearest Neighbors in High-Dimensional Spaces , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[6] Yusu Wang. Approximating nearest neighbor among triangles in convex position , 2008, Inf. Process. Lett..

[7] Sunil Arya,et al. Space-time tradeoffs for approximate nearest neighbor searching , 2009, JACM.

[8] Sunil Arya,et al. Space-time tradeoffs for approximate spherical range counting , 2005, SODA '05.

[9] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .