Approximate distance oracles and ANN structures for short Fréchet queries on curves achieve space O((k log(1/ε) ε^{-d})^k) independent of input size N with O(k^2) query time.
Fast algorithms for approximate Fréchet matching queries in geometric trees
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sublinear data structures for short Fr\'echet queries
Approximate distance oracles and ANN structures for short Fréchet queries on curves achieve space O((k log(1/ε) ε^{-d})^k) independent of input size N with O(k^2) query time.