How to walk your dog in the mountains with no magic leash

DOI10.1007/s00454-015-9737-3zbMath1335.68284arXiv1401.7042OpenAlexW2253735142MaRDI QIDQ5964220

Anastasios Sidiropoulos, Sariel Har-Peled, Mohammad R. Salavatipour, Amir Nayyeri

Publication date: 29 February 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.7042

zbMATH Keywords

approximation algorithmsFréchet distancehomotopy height

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (2)

Homotopy height, grid-major height and graph-drawing height ⋮ Constructing monotone homotopies and sweepouts

Cites Work

• Unnamed Item
• Approximating the Fréchet distance for realistic curves in near linear time
• Shortest path problems on a polyhedral surface
• Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
• Parametrization and smooth approximation of surface triangulations
• New similarity measures between polylines with applications to morphing and polygon sweeping
• The Discrete Geodesic Problem
• Geodesic Fréchet distance inside a simple polygon
• Submodular Percolation
• Detecting Commuting Patterns by Clustering Subtrajectories
• A Separator Theorem for Planar Graphs
• Star Unfolding of a Polytope with Applications
• Computing the Fréchet distance with shortcuts is NP-hard
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Measuring similarity between curves on 2-manifolds via homotopy area
• Computing the Fréchet Distance between Folded Polygons
• Contracting thin disks
• The frechet distance revisited and extended
• Faster shortest-path algorithms for planar graphs

This page was built for publication: How to walk your dog in the mountains with no magic leash