Discrepancy-sensitive dynamic fractional cascading, dominated maxima searching, and 2-D nearest neighbors in any minkowski metric

Authors:
Mikhail J. Atallah;Marina Blanton;Michael T. Goodrich;Stanislas Polu
Affiliations:
Dept. of Computer Sciences, Purdue University;Dept. of Computer Sciences, Purdue University;Dept. of Computer Science, Univ. of California, Irvine;Ecole Polytechnique
Venue:
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Year:
2007

Citing 13
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
K-d trees for semidynamic point sets

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Deterministic skip lists

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Fractional cascading revisited

Journal of Algorithms
Randomized algorithms

Randomized algorithms
An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)
Optimal Expected-Time Algorithms for Closest Point Problems

ACM Transactions on Mathematical Software (TOMS)
Finding nearest neighbors in growth-restricted metrics

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The nearest neighbor

Computational Discrete Mathematics
Navigating nets: simple algorithms for proximity search

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The skip quadtree: a simple dynamic data structure for multidimensional data

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Cover trees for nearest neighbor

ICML '06 Proceedings of the 23rd international conference on Machine learning

Quantified Score

Hi-index	0.00

Visualization

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.