Pages that link to "Item:Q1889583"

The following pages link to Comparison of distance measures for planar curves (Q1889583):

Displaying 18 items.

• Implicitization of curves and (hyper)surfaces using predicted support (Q385002) (← links)
• Approximating the Fréchet distance for realistic curves in near linear time (Q443909) (← links)
• Link distance and shortest path problems in the plane (Q634253) (← links)
• Computing the Fréchet distance between folded polygons (Q904083) (← links)
• Computing the Fréchet distance between simple polygons (Q934016) (← links)
• Fast Fréchet queries (Q1947991) (← links)
• Approximating the packedness of polygonal curves (Q2088893) (← links)
• Fast algorithms for approximate Fréchet matching queries in geometric trees (Q2349741) (← links)
• Optimizing the geometrical accuracy of curvilinear meshes (Q2375013) (← links)
• Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
• Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
• DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES (Q3089091) (← links)
• COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT (Q4650089) (← links)
• (Q5002674) (← links)
• Fast Fréchet Distance Between Curves with Long Edges (Q5197493) (← links)
• Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds (Q5370572) (← links)
• Approximating the Packedness of Polygonal Curves (Q6065398) (← links)
• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)