Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric
DOI10.1007/978-3-540-73951-7_11zbMATH Open1209.68149OpenAlexW2146336126MaRDI QIDQ3603520FDOQ3603520
Authors: Marina Blanton, Stanislas Polu, Mikhail J. Atallah, Michael T. Goodrich 
Publication date: 17 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_11
Recommendations
- Searching dynamic point sets in spaces with bounded doubling dimension
- scientific article; zbMATH DE number 1559576
- Fractional cascading. I: A data structuring technique
- New Techniques for Exact and Approximate Dynamic Closest-Point Problems
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
Data structures (68P05) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
This page was built for publication: Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603520)
