On the complexity of range searching among curves

zbMATH Open1403.68312arXiv1707.04789MaRDI QIDQ4607940FDOQ4607940

Authors: Peyman Afshani, Anne Driemel 

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1707.04789

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

Mathematics Subject Classification ID

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

Cited In (11)

• Title not available (Why is that?)
• An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³
• Fast Fréchet queries
• The VC dimension of metric balls under Fréchet and Hausdorff distances
• ANN for time series under the Fréchet distance
• Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions
• The effect of corners on the complexity of approximate range searching
• Straight-path queries in trajectory data
• A New Lower Bound for Semigroup Orthogonal Range Searching
• Approximate nearest neighbor for curves: simple, efficient, and deterministic
• 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)