Fréchet Queries in Geometric Trees
From MaRDI portal
Publication:2849346
DOI10.1007/978-3-642-40450-4_48zbMath1394.68417OpenAlexW2135367719MaRDI QIDQ2849346
Joachim Gudmundsson, Michiel H. M. Smid
Publication date: 17 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_48
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (5)
Straight-path queries in trajectory data ⋮ Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds ⋮ Fast Fréchet Distance Between Curves with Long Edges ⋮ Skeleton-Based Recognition of Shapes in Images via Longest Path Matching ⋮ Fast algorithms for approximate Fréchet matching queries in geometric trees
This page was built for publication: Fréchet Queries in Geometric Trees