Computing the Fréchet Distance Between Polygons with Holes

DOI10.1007/978-3-662-47672-7_81zbMath1440.68316OpenAlexW2395067785MaRDI QIDQ3448855

Amir Nayyeri, Anastasios Sidiropoulos

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47672-7_81

Mathematics Subject Classification ID

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

Cites Work

• Approximating the Fréchet distance for realistic curves in near linear time
• Spiraling and folding: the word view
• Computing the Fréchet distance between simple polygons
• Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
• Intersections of curves on surfaces
• Computing minimum length paths of a given homotopy class
• Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
• Decidability of string graphs
• BALL-MAP: HOMEOMORPHISM BETWEEN COMPATIBLE SURFACES
• Fréchet Distance of Surfaces: Some Simple Hard Cases
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Computing the Fréchet Distance between Folded Polygons
• Approximate Map Matching with respect to the Fréchet Distance
• Tightening Nonsimple Paths and Cycles on Surfaces
• Fréchet Distance for Curves, Revisited
• Computing the Discrete Fréchet Distance in Subquadratic Time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the Fréchet Distance Between Polygons with Holes