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

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.

[1]  Leonidas J. Guibas,et al.  Fractional cascading: II. Applications , 1986, Algorithmica.

[2]  Robert Krauthgamer,et al.  Navigating nets: simple algorithms for proximity search , 2004, SODA '04.

[3]  D. Farnsworth.  A First Course in Order Statistics , 1993 .

[4]  Bruce W. Weide,et al.  Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.

[5]  David R. Karger,et al.  Finding nearest neighbors in growth-restricted metrics , 2002, STOC '02.

[6]  K. Clarkson.  Nearest-Neighbor Searching and Metric Space Dimensions , 2005 .

[7]  Leonidas J. Guibas,et al.  Fractional cascading: I. A data structuring technique , 1986, Algorithmica.

[8]  Walter W. Piegorsch,et al.  Beta‐Binomial Distribution , 2006 .

[9]  Chee-Keng Yap,et al.  Yet another look at fractional cascading: B-graphs with application to point location , 2001, CCCG.

[10]  J. Ian Munro,et al.  Deterministic skip lists , 1992, SODA '92.

[11]  David Eppstein,et al.  The skip quadtree: a simple dynamic data structure for multidimensional data , 2005, SCG.

[12]  Timothy M. Chan.  A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries , 2006, SODA '06.

[13]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[14]  Christian Worm Mortensen,et al.  Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time , 2003, SODA '03.

[15]  H. T. Kung,et al.  On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.

[16]  Kurt Mehlhorn,et al.  Dynamic fractional cascading , 1990, Algorithmica.

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

[18]  John Langford,et al.  Cover trees for nearest neighbor , 2006, ICML.

[19]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[20]  H. N. Nagaraja,et al.  Order Statistics, Third Edition , 2005, Wiley Series in Probability and Statistics.

[21]  Sandeep Sen.  Fractional Cascading Revisited , 1995, J. Algorithms.

[22]  Jon Louis Bentley,et al.  K-d trees for semidynamic point sets , 1990, SCG '90.

[23]  Bernard Rosner.  Beta-Binomial Distribution , 2005 .

[24]  Bernard Chazelle,et al.  The Discrepancy Method , 1998, ISAAC.