On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the parameterized complexity of \(d\)-dimensional point set pattern matching |
scientific article |
Statements
On the parameterized complexity of \(d\)-dimensional point set pattern matching (English)
0 references
24 March 2010
0 references
computational complexity
0 references
computational geometry
0 references
fixed parameter tractability
0 references
geometric point set matching
0 references
congruence
0 references
unbounded dimension
0 references
