Geodesic Fréchet distance inside a simple polygon
From MaRDI portal
Publication:3188991
DOI10.1145/1868237.1868247zbMath1295.68198arXiv0802.2846OpenAlexW2113946784MaRDI QIDQ3188991
Carola Wenk, Atlas F. IV. Cook
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0802.2846
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)
Related Items (7)
Computing the Fréchet distance with a retractable leash ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ Unnamed Item ⋮ Minimization of the maximum distance between the two guards patrolling a polygonal region ⋮ Relative convex hulls in semi-dynamic arrangements ⋮ Improved algorithms for partial curve matching ⋮ How to walk your dog in the mountains with no magic leash
This page was built for publication: Geodesic Fréchet distance inside a simple polygon
