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 17 items.
- The parameterized complexity of geometric graph isomorphism (Q309786) (← links)
- Applications of dimensionality reduction and exponential sums to graph automorphism (Q551192) (← links)
- Combinatorial and experimental results for randomized point matching algorithms (Q1286470) (← links)
- On the geometric graph isomorphism problem (Q1358911) (← 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)
- Preliminary exploration on properties of the equidistant conjugate points of higher dimensional simplex (Q2860318) (← links)
- Congruence Testing of Point Sets in 4-Space. (Q3132884) (← links)
- (Q3440994) (← links)
- (Q3675070) (← links)
- (Q4525682) (← links)
- Generalized approximate algorithms for point set congruence (Q5060129) (← links)
- On the number of congruent simplices in a point (Q5361552) (← links)
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES (Q5484909) (← links)
