Fréchet Distance of Surfaces: Some Simple Hard Cases

DOI10.1007/978-3-642-15781-3_6zbMath1287.68169OpenAlexW2135531396MaRDI QIDQ3586384

André Schulz, Kevin Buchin, Maike Buchin

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15781-3_6

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Computing the similarity between moving curves, Computing the Fréchet Distance Between Polygons with Holes, Four Soviets walk the dog: improved bounds for computing the Fréchet distance, Computing the Fréchet distance between folded polygons, Distances between immersed graphs: metric properties, The frechet distance revisited and extended