| Geometric Hashing Advantages |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Advantages |
||||||||||||
| – | Depending
on problem |
||||||||||||
| O(n3)
may be significantly |
|||||||||||||
| better
than O(m3n2) |
|||||||||||||
| – | If we
want to search for |
||||||||||||
| multiple
patterns, this |
|||||||||||||
| affects
the preprocessing |
|||||||||||||
| time,
but not the matching |
|||||||||||||
| time |
|||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
| • | Time
is better in practice |
||||||||||
| than
big-O bound |
|||||||||||
| – | Can
often reject a pair (s,t) |
||||||||||
| of
scene points quickly |
|||||||||||
| because,
for instance, |
|||||||||||
| they’re
too far apart to |
|||||||||||
| match
any pair of pattern |
|||||||||||
| points |
|||||||||||
| CS409 - Spring
2000 |
| 13 |