Range reporting for time series via rectangle stabbing

DOI10.4230/LIPICS.SWAT.2024.15MaRDI QIDQ6891141zbMATH OpenFDO

Authors Lotte Blank, Anne Driemel

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SWAT.2024.15

zbMATH Keywords

data structuresFréchet distanceorthogonal range searchingrectangle stabbing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• ANN for time series under the Fréchet distance
• Approximate nearest neighbor for curves: simple, efficient, and deterministic
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Fast Fréchet queries
• Filtering Search: A New Approach to Query-Answering
• Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
• Locality-sensitive hashing of curves
• Lower bounds for orthogonal range searching: I. The reporting case
• On the complexity of range searching among curves
• The Computational Geometry of Comparing Shapes
• Tight bounds for approximate near neighbor searching for time series under the Fréchet distance

This page was built for publication: Range reporting for time series via rectangle stabbing

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