Pages that link to "Item:Q1328753"
From MaRDI portal
The following pages link to Approximate decision algorithms for point set congruence (Q1328753):
Displaying 25 items.
- Approximate one-to-one point pattern matching (Q450574) (← links)
- Noisy colored point set matching (Q628337) (← links)
- Approximate input sensitive algorithms for point pattern matching (Q733152) (← 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)
- The translation square map and approximate congruence (Q1182089) (← links)
- Approximate decision algorithms for approximate congruence (Q1198006) (← links)
- On the geometric graph isomorphism problem (Q1358911) (← links)
- On determining the congruence of point sets in \(d\) dimensions (Q1384212) (← links)
- Congruence, similarity, and symmetries of geometric objects (Q1822962) (← links)
- Approximate congruence in nearly linear time (Q1869745) (← links)
- Bipartite diameter and other measures under translation (Q2172648) (← links)
- Improved approximation bounds for planar point pattern matching (Q2480906) (← links)
- Matching sets of line segments (Q2662685) (← links)
- (Q2753922) (← links)
- Congruence Testing of Point Sets in 4-Space. (Q3132884) (← links)
- Finding Largest Common Point Sets (Q3132918) (← links)
- AN FPTAS FOR COMPUTING THE SIMILARITY OF THREE-DIMENSIONAL POINT SETS (Q3442764) (← links)
- (Q4525682) (← links)
- Improvements on geometric pattern matching problems (Q5056151) (← links)
- Generalized approximate algorithms for point set congruence (Q5060129) (← links)
- (Q5090454) (← links)
- (Q5111688) (← links)
- AN APPROXIMATE MORPHING BETWEEN POLYLINES (Q5311633) (← links)
- On computing a center persistence diagram (Q6546596) (← links)
