Pages that link to "Item:Q676592"
From MaRDI portal
The following pages link to Geometric pattern matching under Euclidean motion (Q676592):
Displaying 23 items.
- Ant colony optimization based binary search for efficient point pattern matching in images (Q319734) (← links)
- Approximate one-to-one point pattern matching (Q450574) (← links)
- Parametric search made practical (Q598230) (← links)
- Noisy colored point set matching (Q628337) (← links)
- Approximate input sensitive algorithms for point pattern matching (Q733152) (← links)
- Pattern matching in doubling spaces (Q832835) (← links)
- Geometric pattern matching for point sets in the plane under similarity transformations (Q989531) (← links)
- Convex hull analysis of evolutionary and phylogenetic relationships between biological groups (Q1714357) (← links)
- Discrete and geometric branch and bound algorithms for~medical image registration (Q1761852) (← links)
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering (Q1774572) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation (Q1923771) (← links)
- Biomolecular topology: modelling and analysis (Q2096944) (← links)
- Geometric pattern matching reduces to \(k\)-SUM (Q2172655) (← links)
- On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems (Q2408088) (← links)
- Improved approximation bounds for planar point pattern matching (Q2480906) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- Matching sets of line segments (Q2662685) (← links)
- MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION (Q3405970) (← links)
- AN FPTAS FOR COMPUTING THE SIMILARITY OF THREE-DIMENSIONAL POINT SETS (Q3442764) (← links)
- Geometric Pattern Matching Reduces to k-SUM. (Q6065434) (← links)
- Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points (Q6182460) (← links)
