Pages that link to "Item:Q1889585"
From MaRDI portal
The following pages link to Combinatorial and experimental methods for approximate point pattern matching (Q1889585):
Displaying 15 items.
- Approximate input sensitive algorithms for point pattern matching (Q733152) (← links)
- Recurrence analysis on Julia sets of semigroups of complex polynomials (Q741394) (← links)
- Output sensitive algorithms for approximate incidences and their applications (Q827295) (← links)
- Geometric pattern matching for point sets in the plane under similarity transformations (Q989531) (← links)
- Small candidate set for translational pattern search (Q2088592) (← links)
- Geometric pattern matching reduces to \(k\)-SUM (Q2172655) (← links)
- Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space (Q2380079) (← links)
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems (Q2408088) (← links)
- Hausdorff matching and Lipschitz optimization (Q2457916) (← links)
- Finding Largest Common Point Sets (Q3132918) (← links)
- MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION (Q3405970) (← links)
- Genetic algorithm for affine point pattern matching (Q4421023) (← links)
- (Q5111688) (← links)
- (Q5399252) (← links)
- Geometric Pattern Matching Reduces to k-SUM. (Q6065434) (← links)