Pages that link to "Item:Q4698353"

The following pages link to COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES (Q4698353):

Displaying 50 items.

• Following a curve with the discrete Fréchet distance (Q300222) (← links)
• Computing the Fréchet distance with a retractable leash (Q312142) (← links)
• Strong path convergence from Loewner driving function convergence (Q414278) (← links)
• Shape matching by random sampling (Q441886) (← links)
• Approximating the Fréchet distance for realistic curves in near linear time (Q443909) (← links)
• Shortest path problems on a polyhedral surface (Q472466) (← links)
• Parametric search made practical (Q598230) (← links)
• Fréchet distance with speed limits (Q621928) (← links)
• Optimal grids for five-axis machining (Q622196) (← links)
• Link distance and shortest path problems in the plane (Q634253) (← links)
• Approximately matching polygonal curves with respect to the Fréchet distance (Q705548) (← links)
• Fréchet distance between a line and avatar point set (Q722543) (← links)
• The minimum moving spanning tree problem (Q832829) (← links)
• Can we compute the similarity between surfaces? (Q848860) (← links)
• Computing the Fréchet distance between piecewise smooth curves (Q883235) (← links)
• Computing the Fréchet distance between folded polygons (Q904083) (← links)
• Computing the Fréchet distance between simple polygons (Q934016) (← links)
• Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
• Approximating the integral Fréchet distance (Q1615637) (← links)
• Computing the similarity between moving curves (Q1615772) (← links)
• Locally correct Fréchet matchings (Q1624582) (← links)
• Fast Fréchet queries (Q1947991) (← links)
• Distance measures for embedded graphs (Q1984601) (← links)
• Risk-optimal path planning in stochastic dynamic environments (Q1988113) (← links)
• Computing the Fréchet gap distance (Q2022625) (← links)
• Computing the \(k\)-visibility region of a point in a polygon (Q2032289) (← links)
• Fréchet distance between two point sets (Q2064018) (← links)
• On the computability of the set of automorphisms of the unit square (Q2072068) (← links)
• Approximating the packedness of polygonal curves (Q2088893) (← links)
• Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
• The prefix Fréchet similarity (Q2123283) (← links)
• Measuring and improving the geometric accuracy of piece-wise polynomial boundary meshes (Q2132581) (← links)
• Middle curves based on discrete Fréchet distance (Q2206718) (← links)
• An effective and versatile distance measure for spatiotemporal trajectories (Q2218340) (← links)
• Improved algorithms for partial curve matching (Q2249744) (← links)
• Recognizing the similarity of polygons in a strengthened Hausdorff metric (Q2263300) (← links)
• Progressive simplification of polygonal curves (Q2306367) (← links)
• Stochastic time-optimal path-planning in uncertain, strong, and dynamic flows (Q2310884) (← links)
• Weighted minimum backward Fréchet distance (Q2317859) (← links)
• Fast algorithms for approximate Fréchet matching queries in geometric trees (Q2349741) (← links)
• Semantic spaces (Q2364884) (← links)
• Median trajectories (Q2375955) (← links)
• Curve matching, time warping, and light fields: New algorithms for computing similarity between curves (Q2384118) (← links)
• Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
• Gromov-Fréchet distance between curves (Q2414410) (← links)
• Efficient observer-dependent simplification in polygonal domains (Q2428687) (← links)
• Similarity of polygonal curves in the presence of outliers (Q2444314) (← links)
• Minimization of the maximum distance between the two guards patrolling a polygonal region (Q2445875) (← links)
• A sequential algorithm for recognition of a developing pattern with application in orthotic engineering (Q2459564) (← links)
• Floating tangents for approximating spatial curves with \(G^1\) piecewise helices (Q2637080) (← links)