Products of Euclidean Metrics and Applications to Proximity Questions among Curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Products of Euclidean Metrics and Applications to Proximity Questions among Curves

Abstract

The problem of Approximate Nearest Neighbor (ANN) search is fundamental in computer science and has benefited from significant progress in the past couple of decades. However, most work has been devoted to pointsets whereas complex shapes have not been sufficiently treated. Here, we focus on distance functions between discretized curves in Euclidean space: they appear in a wide range of applications, from road segments and molecular backbones to time-series in general dimension. For p-products of Euclidean metrics, for any p ≥ 1, we design simple and efficient data structures for ANN, based on randomized projections, which are of independent interest. They serve to solve proximity problems under a notion of distance between discretized curves, which generalizes both discrete Fréchet and Dynamic Time Warping distances. These are the most popular and practical approaches to comparing such curves. We offer the first data structures and query algorithms for ANN with arbitrarily good approximation factor, at the expense of increasing space usage and preprocessing time over existing methods. Query time complexity is comparable or significantly improved by our algorithms; our approach is especially efficient when the length of the curves is bounded. 2012 ACM Subject Classification Theory of computation → Data structures design and analysis
Fichier principal
Vignette du fichier
LIPIcs-SoCG-2018-37.pdf (489.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01897266 , version 1 (17-10-2018)

Identifiers

Cite

Ioannis Z. Emiris, Ioannis Psarros. Products of Euclidean Metrics and Applications to Proximity Questions among Curves. 34th International Symposium on Computational Geometry (SoCG 2018), Jun 2018, Budapest, Hungary. ⟨10.4230/LIPIcs.SoCG.2018.37⟩. ⟨hal-01897266⟩
65 View
32 Download

Altmetric

Share

Gmail Facebook X LinkedIn More