COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES

DOI10.1142/S0218195995000064zbMATH Open0941.68809DBLPjournals/ijcga/AltG95WikidataQ61632357 ScholiaQ61632357MaRDI QIDQ4698353FDOQ4698353

Michael Godau, Helmut Alt

Publication date: 26 February 1996

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Recommendations

• Fréchet distance with speed limits
• Computing the Fréchet distance between simple polygons
• Computing the Fréchet distance between piecewise smooth curves
• Fréchet Distance for Curves, Revisited

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (only showing first 100 items - show all)

• Risk-optimal path planning in stochastic dynamic environments
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semantic spaces
• The Computational Geometry of Comparing Shapes
• An effective and versatile distance measure for spatiotemporal trajectories
• DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES
• The minimum moving spanning tree problem
• Geodesic Fréchet distance inside a simple polygon
• Stochastic time-optimal path-planning in uncertain, strong, and dynamic flows
• Approximating the integral Fréchet distance
• Approximating the packedness of polygonal curves
• Computing the similarity between moving curves
• Shape Matching by Random Sampling
• Four Soviets walk the dog: improved bounds for computing the Fréchet distance
• Computing the minimum distance between two Bézier curves
• Computing the Fréchet distance between simple polygons
• Can we compute the similarity between surfaces?
• Fast Fréchet queries
• Fast algorithms for approximate Fréchet matching queries in geometric trees
• The VC dimension of metric balls under Fréchet and Hausdorff distances
• COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT
• FRÉCHET DISTANCE PROBLEMS IN WEIGHTED REGIONS
• On the Chain Pair Simplification Problem
• Computing the Fréchet Gap Distance
• Link Distance and Shortest Path Problems in the Plane
• Similarity of polygonal curves in the presence of outliers
• Shape matching by random sampling
• Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
• Computing the \(k\)-visibility region of a point in a polygon
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Shortest Path Problems on a Polyhedral Surface
• Fréchet distance between a line and avatar point set
• Approximating the Fréchet distance for realistic curves in near linear time
• The frechet distance revisited and extended
• Progressive simplification of polygonal curves
• On Computing the Fréchet Distance Between Surfaces.
• Shortest path problems on a polyhedral surface
• Optimal grids for five-axis machining
• Following a curve with the discrete Fréchet distance
• Approximately matching polygonal curves with respect to the Fréchet distance
• Floating tangents for approximating spatial curves with \(G^1\) piecewise helices
• Fréchet distance between two point sets
• Distance measures for embedded graphs
• Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
• AN APPROXIMATE MORPHING BETWEEN POLYLINES
• Computing the extreme distances between two convex polygons
• Title not available (Why is that?)
• Link distance and shortest path problems in the plane
• Locally correct Fréchet matchings
• Computing the Fréchet gap distance
• Computing the Fréchet distance with a retractable leash
• Gromov-Fréchet distance between curves
• Sequences of spanning trees and a fixed tree theorem
• Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
• Fréchet distance with speed limits
• Computing the Fréchet distance between folded polygons
• Computing the Fréchet distance between piecewise smooth curves
• Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
• Parametric search made practical
• Two problems concerning Fréchet distance and lines of evasion
• Approximating the Packedness of Polygonal Curves
• Strong path convergence from Loewner driving function convergence
• Discretely Following a Curve
• More flexible curve matching via the partial Fréchet similarity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Global Curve Simplification
• On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance
• Fast Fréchet Distance Between Curves with Long Edges
• Path Counting for Grid-Based Navigation
• The prefix Fréchet similarity
• Computing the Fréchet Distance Between Polygons with Holes
• When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Fine-grained complexity theory: conditional lower bounds for computational geometry
• Streaming algorithms for line simplification
• The Minimum Moving Spanning Tree Problem
• Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance
• Approximating the \(\lambda \)-low-density value
• Title not available (Why is that?)
• Improved algorithms for partial curve matching
• A sequential algorithm for recognition of a developing pattern with application in orthotic engineering
• Translation invariant Fréchet distance queries
• Approximating ( k,ℓ )-Median Clustering for Polygonal Curves
• Fréchet Distance for Uncertain Curves
• Measuring and improving the geometric accuracy of piece-wise polynomial boundary meshes
• Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary
• On length-sensitive Fréchet similarity
• Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
• Computing the Fréchet distance between uncertain curves in one dimension
• Recognizing the similarity of polygons in a strengthened Hausdorff metric
• On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions
• 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
• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
• Computing the Fréchet distance between uncertain curves in one dimension
• Fréchet similarity of closed polygonal curves

This page was built for publication: COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698353)