On the complexity of range searching among curves

MaRDI QIDQ4607940zbMATH OpenFDO

Authors Peyman Afshani, Anne Driemel

Publication date 15 March 2018

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Fast Fréchet queries
• Fréchet Distance for Curves, Revisited
• Fast Fréchet distance between curves with long edges
• Fast algorithms for approximate Fréchet matching queries in geometric trees

Cited in

(11)

• The VC dimension of metric balls under Fréchet and Hausdorff distances
• A New Lower Bound for Semigroup Orthogonal Range Searching
• ANN for time series under the Fréchet distance
• An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³
• The effect of corners on the complexity of approximate range searching
• Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions
• Straight-path queries in trajectory data
• Fast Fréchet queries
• Approximate nearest neighbor for curves: simple, efficient, and deterministic
• scientific article; zbMATH DE number 7559228 (Why is no real title available?)
• Fast Fréchet queries

This page was built for publication: On the complexity of range searching among curves

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