Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
From MaRDI portal
Publication:1037652
DOI10.1016/j.comgeo.2009.02.008zbMath1203.65031OpenAlexW2134112278WikidataQ61632358 ScholiaQ61632358MaRDI QIDQ1037652
Éric Colin de Verdière, Shripad Thite, Jeff Erickson, Erin Wolf Chambers, Francis Lazarus, 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
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items
Measuring and improving the geometric accuracy of piece-wise polynomial boundary meshes, Computing the Fréchet Distance Between Polygons with Holes, Median trajectories, Four Soviets walk the dog: improved bounds for computing the Fréchet distance, Fréchet distance with speed limits, Unnamed Item, 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, Constructing monotone homotopies and sweepouts, Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary
Cites Work
- Parametric search made practical
- Constrained Delaunay triangulations
- A new data structure for shortest path queries in a simple polygon
- Computing minimum length paths of a given homotopy class
- The nature and meaning of perturbations in geometric computing
- Testing homotopy for paths in the plane
- Optimal shortest path queries in a simple polygon
- New similarity measures between polylines with applications to morphing and polygon sweeping
- Minimal tangent visibility graphs
- Computing homotopic shortest paths efficiently
- Euclidean shortest paths in the presence of rectilinear barriers
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Parallel Merge Sort
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Slowing down sorting networks to obtain faster sorting algorithms
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Fréchet Distance for Curves, Revisited
- LATIN 2004: Theoretical Informatics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
