COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
From MaRDI portal
Publication:4698353
DOI10.1142/S0218195995000064zbMath0941.68809WikidataQ61632357 ScholiaQ61632357MaRDI QIDQ4698353
Publication date: 26 February 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance, On length-sensitive Fréchet similarity, Unnamed Item, Approximating the integral Fréchet distance, Computing the similarity between moving curves, The prefix Fréchet similarity, The Minimum Moving Spanning Tree Problem, Semantic spaces, Locally correct Fréchet matchings, The minimum moving spanning tree problem, Measuring and improving the geometric accuracy of piece-wise polynomial boundary meshes, Computing the Fréchet Distance Between Polygons with Holes, Following a curve with the discrete Fréchet distance, On the Chain Pair Simplification Problem, Median trajectories, Computing the Fréchet distance with a retractable leash, Can we compute the similarity between surfaces?, Floating tangents for approximating spatial curves with \(G^1\) piecewise helices, Shortest Path Problems on a Polyhedral Surface, Curve matching, time warping, and light fields: New algorithms for computing similarity between curves, AN OPTIMAL MORPHING BETWEEN POLYLINES, AN APPROXIMATE MORPHING BETWEEN POLYLINES, Parametric search made practical, Four Soviets walk the dog: improved bounds for computing the Fréchet distance, The VC dimension of metric balls under Fréchet and Hausdorff distances, Translation invariant Fréchet distance queries, Computing the Fréchet distance between piecewise smooth curves, Path Counting for Grid-Based Navigation, Gromov-Fréchet distance between curves, On fully diverse sets of geometric objects and graphs, Approximating ( k,ℓ )-Median Clustering for Polygonal Curves, Fréchet Distance for Uncertain Curves, On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions, Fréchet distance with speed limits, Optimal grids for five-axis machining, A representation of cloth states based on a derivative of the Gauss linking integral, Discrete Fréchet distance for closed curves, Strong path convergence from Loewner driving function convergence, Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance, Efficient observer-dependent simplification in polygonal domains, Computing the Fréchet distance between folded polygons, Distances between immersed graphs: metric properties, Link distance and shortest path problems in the plane, Fast Fréchet queries, Unnamed Item, Middle curves based on discrete Fréchet distance, Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds, Shape matching by random sampling, Approximating the Fréchet distance for realistic curves in near linear time, Similarity of polygonal curves in the presence of outliers, Minimization of the maximum distance between the two guards patrolling a polygonal region, An effective and versatile distance measure for spatiotemporal trajectories, Shortest path problems on a polyhedral surface, Computing the Fréchet distance between simple polygons, Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails, A sequential algorithm for recognition of a developing pattern with application in orthotic engineering, When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation, Computing the Fréchet distance between uncertain curves in one dimension, Distance measures for embedded graphs, The frechet distance revisited and extended, Risk-optimal path planning in stochastic dynamic environments, Approximating the Packedness of Polygonal Curves, COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT, Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance, Improved algorithms for partial curve matching, FRÉCHET DISTANCE PROBLEMS IN WEIGHTED REGIONS, Computing the Fréchet distance between uncertain curves in one dimension, Recognizing the similarity of polygons in a strengthened Hausdorff metric, Approximately matching polygonal curves with respect to the Fréchet distance, VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE, Computing the Fréchet gap distance, Unnamed Item, Unnamed Item, Unnamed Item, Fréchet distance between a line and avatar point set, Shape Matching by Random Sampling, Fast Fréchet Distance Between Curves with Long Edges, Sequences of spanning trees and a fixed tree theorem, Computing the \(k\)-visibility region of a point in a polygon, How to walk your dog in the mountains with no magic leash, Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance, Global Curve Simplification, More Flexible Curve Matching via the Partial Fréchet Similarity, Fréchet Similarity of Closed Polygonal Curves, Unnamed Item, Streaming algorithms for line simplification, DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES, Progressive simplification of polygonal curves, Link Distance and Shortest Path Problems in the Plane, Stochastic time-optimal path-planning in uncertain, strong, and dynamic flows, Fréchet distance between two point sets, The Computational Geometry of Comparing Shapes, Weighted minimum backward Fréchet distance, On the computability of the set of automorphisms of the unit square, Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time, Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary, On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance, Approximating the packedness of polygonal curves, Unnamed Item, Discretely Following a Curve, Fast algorithms for approximate Fréchet matching queries in geometric trees, Fine-grained complexity theory: conditional lower bounds for computational geometry
