Fast Fréchet queries

DOI10.1016/j.comgeo.2012.11.006zbMath1272.65025OpenAlexW2116264435MaRDI QIDQ1947991

Atlas F. IV. Cook, Mark T. de Berg, Joachim Gudmundsson

Publication date: 29 April 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.11.006

zbMATH Keywords

data structurescomputational geometryFréchet distancequery timeinclusion-minimal subpathquery segmentquery structure

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (9)

ANN for time series under the Fréchet distance ⋮ Straight-path queries in trajectory data ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ The VC dimension of metric balls under Fréchet and Hausdorff distances ⋮ Translation invariant Fréchet distance queries ⋮ On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions ⋮ Approximate nearest neighbor for curves: simple, efficient, and deterministic ⋮ Unnamed Item ⋮ Fast algorithms for approximate Fréchet matching queries in geometric trees

Cites Work

• Calculating the Hausdorff distance between curves
• Approximately matching polygonal curves with respect to the Fréchet distance
• Comparison of distance measures for planar curves
• Approximate matching of polygonal shapes
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
• Optimal partition trees
• Approximating the Fréchet distance for realistic curves in near linear time
• Fréchet Distance for Curves, Revisited
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast Fréchet queries