Fréchet distance of surfaces: some simple hard cases

DOI10.1007/978-3-642-15781-3_6zbMATH Open1287.68169OpenAlexW2135531396MaRDI QIDQ3586384FDOQ3586384

Authors: Kevin Buchin, Maike Buchin, André Schulz 

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

Recommendations

• Computing the Fréchet distance between polygons with holes
• Computing the Fréchet distance between simple polygons
• On the decidability of the Fréchet distance between surfaces
• Computing the Fréchet distance between folded polygons
• Computing the Fréchet distance between real-valued surfaces

Mathematics Subject Classification ID

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

Cited In (7)

• Four Soviets walk the dog: improved bounds for computing the Fréchet distance
• Computing the Fréchet distance between real-valued surfaces
• On Computing the Fréchet Distance Between Surfaces.
• Computing the Fréchet distance between folded polygons
• Computing the Fréchet distance between polygons with holes
• On the decidability of the Fréchet distance between surfaces
• Distances between immersed graphs: metric properties

This page was built for publication: Fréchet distance of surfaces: some simple hard cases

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