Pages that link to "Item:Q1891233"
From MaRDI portal
The following pages link to Point set pattern matching in \(d\)-dimensions (Q1891233):
Displaying 20 items.
- One-dimensional approximate point set pattern matching with \(L_p\)-norm (Q389940) (← links)
- Approximate input sensitive algorithms for point pattern matching (Q733152) (← links)
- Geometric pattern matching in \(d\)-dimensional space (Q1283771) (← links)
- On determining the congruence of point sets in \(d\) dimensions (Q1384212) (← links)
- Efficient point pattern matching algorithm for planar point sets under transform of translation, rotation and scale (Q1646156) (← links)
- Combinatorial and experimental methods for approximate point pattern matching (Q1889585) (← links)
- Point set pattern matching in \(d\)-dimensions (Q1891233) (← links)
- On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
- Matching point sets with respect to the earth mover's distance (Q2462736) (← links)
- Improved approximation bounds for planar point pattern matching (Q2480906) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- Finding Largest Common Point Sets (Q3132918) (← links)
- Geometric matching under noise: Combinatorial bounds and algorithms (Q4252321) (← links)
- Computing and Combinatorics (Q4681183) (← links)
- (Q4737694) (← links)
- Combinatorial Pattern Matching (Q5315359) (← links)
- (Q5399252) (← links)
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES (Q5484909) (← links)
- Algorithms and Computation (Q5712142) (← links)
- Geometric pattern matching in d-dimensional space (Q6102306) (← links)