On the parameterized complexity of d-dimensional point set pattern matching.
Sergio CabelloPanos GiannopoulosChristian KnauerPublished in: Inf. Process. Lett. (2008)
Keyphrases
- pattern matching
- point sets
- parameterized complexity
- point correspondences
- fixed parameter tractable
- global constraints
- pairwise
- string matching
- convex hull
- pattern matching algorithm
- multi dimensional
- graph matching
- distance function
- matching process
- computational problems
- boyer moore
- point set registration
- learning algorithm
- relational data
- closed form
- data management
- special case
- query processing
- search algorithm