Pages that link to "Item:Q676592"
From MaRDI portal
The following pages link to Geometric pattern matching under Euclidean motion (Q676592):
Displayed 7 items.
- Parametric search made practical (Q598230) (← 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)
- Improved approximation bounds for planar point pattern matching (Q2480906) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- AN FPTAS FOR COMPUTING THE SIMILARITY OF THREE-DIMENSIONAL POINT SETS (Q3442764) (← links)