The following pages link to Matching planar maps (Q4458868):
Displaying 25 items.
- Following a curve with the discrete Fréchet distance (Q300222) (← links)
- Shape matching by random sampling (Q441886) (← links)
- Fréchet distance with speed limits (Q621928) (← links)
- Computing the Fréchet distance between piecewise smooth curves (Q883235) (← links)
- Computing the Fréchet distance between folded polygons (Q904083) (← links)
- Computing the similarity between moving curves (Q1615772) (← links)
- Closest paths in graph drawings under an elastic metric (Q1784072) (← links)
- Distance measures for embedded graphs (Q1984601) (← links)
- Integrated shape-sensitive functional metrics (Q2078545) (← links)
- Improved algorithms for partial curve matching (Q2249744) (← links)
- Fast algorithms for approximate Fréchet matching queries in geometric trees (Q2349741) (← links)
- Conflating two polygonal lines (Q2369551) (← links)
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves (Q2384118) (← links)
- Coastline matching via a graph-based approach (Q2677371) (← links)
- Distances between immersed graphs: metric properties (Q2691630) (← links)
- Pattern matching for sets of segments (Q2768308) (← links)
- Skeleton-Based Recognition of Shapes in Images via Longest Path Matching (Q2799975) (← links)
- Discretely Following a Curve (Q2867104) (← links)
- Planarizing Gadgets for Perfect Matching Do Not Exist (Q2912747) (← links)
- (Q3009716) (← links)
- Shape Matching by Random Sampling (Q3605513) (← links)
- Global Curve Simplification (Q5075813) (← links)
- The frechet distance revisited and extended (Q5404460) (← links)
- (Q5743403) (← links)
- Approximating the \(\lambda \)-low-density value (Q6591458) (← links)