Fast, precise and dynamic distance queries

MaRDI QIDQ5365085zbMATH OpenFDO

Authors Tsvi Kopelowitz, Liam Roditty, Yair Bartal, Lee-Ad Gottlieb, Moshe Lewenstein

Publication date 29 September 2017

Full work available at URL https://arxiv.org/abs/1008.1480, http://dl.acm.org/citation.cfm?id=2133102

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Searching dynamic point sets in spaces with bounded doubling dimension
• scientific article; zbMATH DE number 2149349
• scientific article; zbMATH DE number 2038782
• Approximate distance oracles with constant query time
• Approximate distance oracles for geometric spanners

Cited in

(12)

• Preprocess, set, query!
• An axiomatic approach to time-dependent shortest path oracles
• An efficient sum query algorithm for distance-based locally dominating functions
• Searching dynamic point sets in spaces with bounded doubling dimension
• Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
• Fast approximation in subspaces by doubling metric decomposition
• scientific article; zbMATH DE number 2038782 (Why is no real title available?)
• Tie-breaking strategies for fast distance join processing
• scientific article; zbMATH DE number 2149349 (Why is no real title available?)
• Shortest-path queries in static networks
• scientific article; zbMATH DE number 7650073 (Why is no real title available?)
• Dynamic data structures for approximate Hausdorff distance in the word RAM

This page was built for publication: Fast, precise and dynamic distance queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365085)