Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
DOI10.1016/J.COMGEO.2009.02.008zbMATH Open1203.65031DBLPjournals/comgeo/ChambersVELLT10OpenAlexW2134112278WikidataQ61632358 ScholiaQ61632358MaRDI QIDQ1037652FDOQ1037652
Authors: Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, Shripad Thite, Sylvain Lazard 
Publication date: 16 November 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00438463/file/frechet.pdf
Recommendations
- Fréchet Distance for Curves, Revisited
- Tightness and computing distances in the curve complex
- On the decidability of the Fréchet distance between surfaces
- Homotopic distance between maps
- Folding free-space diagrams: computing the Fréchet distance between 1-dimensional curves
- Determining the Hausdorff distance between trees in polynomial time
- Gromov-Fréchet distance between curves
- Efficient geodesics and an effective algorithm for distance in the complex of curves
- Approximating the Hausdorff distance by \(\alpha\)-dense curves
- scientific article; zbMATH DE number 176499
Computer-aided design (modeling of curves and surfaces) (65D17) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- The nature and meaning of perturbations in geometric computing
- Title not available (Why is that?)
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Slowing down sorting networks to obtain faster sorting algorithms
- Parallel Merge Sort
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Euclidean shortest paths in the presence of rectilinear barriers
- Title not available (Why is that?)
- Optimal shortest path queries in a simple polygon
- Constrained Delaunay triangulations
- Fréchet Distance for Curves, Revisited
- New similarity measures between polylines with applications to morphing and polygon sweeping
- Geodesic Fréchet distance inside a simple polygon
- Parametric search made practical
- Computing minimum length paths of a given homotopy class
- Minimal tangent visibility graphs
- A new data structure for shortest path queries in a simple polygon
- Testing homotopy for paths in the plane
- Computing homotopic shortest paths efficiently
- Title not available (Why is that?)
- LATIN 2004: Theoretical Informatics
Cited In (17)
- Title not available (Why is that?)
- Tighter connections between Formula-SAT and shaving logs
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Walking your dog in the woods in polynomial time
- Measuring and improving the geometric accuracy of piece-wise polynomial boundary meshes
- How to walk your dog in the mountains with no magic leash
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
- How to walk your dog in the mountains with no magic leash
- Fréchet distance with speed limits
- Computing the Fréchet distance between polygons with holes
- Computing optimal homotopies over a spiked plane with polygonal boundary
- Constructing monotone homotopies and sweepouts
- Fréchet distance problems in weighted regions
- Fréchet distance problems in weighted regions
- Title not available (Why is that?)
- Two problems concerning Fréchet distance and lines of evasion
- Median trajectories
This page was built for publication: Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1037652)
