Approximate congruence in nearly linear time
The problem of geometric point set matching has been studied extensively in the domain of computational geometry, and has many applications in areas such as computer vision, computational chemistry, and pattern recognition. One of the commonly used metrics is the bottleneck distance, which for two p...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Elsevier,
2014-05-15T17:33:22Z.
|
| Subjects: | |
| Online Access: | Get fulltext |