Emiris, Ioannis Z.2; Malamatos, Theocharis3; Tsigaridas, Elias5
1 Department of Computer Science, Faculty of Science, Aarhus University, Aarhus University2 University of Athens3 University of Pelopennese4 Department of Computer Science, Science and Technology, Aarhus University5 Department of Computer Science, Science and Technology, Aarhus University
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.
26th European Workshop on Computational Geometry: Workshop Proceedings, 2010, p. 141-144