Files:

[PDF] 127.3kB  [gzipped postscript] 163.6kB  

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 give efficient solutions for these as well.

BibTeX:
@InProceedings{emt-eurocg-2010,
  author =       {Ioannis~Z. Emiris and Theocharis Malamatos and
                  Elias~P. Tsigaridas},
  title =        {Approximate nearest neighbor queries among parallel
                  segments},
  booktitle =    {26th European Workshop on Computational Geometry
                  (EuroCG)},
  year =         2010,
  pages =        {141--144},
  month =        {Mar 22--24},
  address =      {Dortmund, Germany},
  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 give efficient solutions
                  for these as well.",
}

Generated by bib2html.pl (written by Patrick Riley , modified by Elias ) on Wed Oct 23, 2019 21:41:02