Pages that link to "Item:Q1384212"
From MaRDI portal
The following pages link to On determining the congruence of point sets in \(d\) dimensions (Q1384212):
Displaying 8 items.
- The parameterized complexity of geometric graph isomorphism (Q309786) (← links)
- Applications of dimensionality reduction and exponential sums to graph automorphism (Q551192) (← links)
- Enumeration of 2-level polytopes (Q1741129) (← links)
- On finding maximum-cardinality symmetric subsets (Q1869736) (← links)
- On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- EQUIVALENCE OF TOPOLOGICAL FORM FOR CURVILINEAR GEOMETRIC OBJECTS (Q2708041) (← links)
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES (Q5484909) (← links)
