Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric

  • Mikhail J. Atallah
  • Marina Blanton
  • Michael T. Goodrich
  • Stanislas Polu
Conference paper

DOI: 10.1007/978-3-540-73951-7_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4619)
Cite this paper as:
Atallah M.J., Blanton M., Goodrich M.T., Polu S. (2007) Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric. In: Dehne F., Sack JR., Zeh N. (eds) Algorithms and Data Structures. WADS 2007. Lecture Notes in Computer Science, vol 4619. Springer, Berlin, Heidelberg

Abstract

This paper studies a discrepancy-sensitive approach to dynamic fractional cascading. We provide an efficient data structure for dominated maxima searching in a dynamic set of points in the plane, which in turn leads to an efficient dynamic data structure that can answer queries for nearest neighbors using any Minkowski metric.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Mikhail J. Atallah
    • 1
  • Marina Blanton
    • 1
  • Michael T. Goodrich
    • 2
  • Stanislas Polu
    • 3
  1. 1.Dept. of Computer Sciences, Purdue Univ. 
  2. 2.Dept. of Computer Science, Univ. of California, Irvine 
  3. 3.École Polytechnique 

Personalised recommendations