|
Volumn 10, Issue 3, 1998, Pages 197-202
|
Getting around a lower bound for the minimum Hausdorff distance
a b |
Author keywords
Algorithm; Approximate matching; Geometric pattern matching; Optimization; Segment tree
|
Indexed keywords
|
EID: 0040633364
PISSN: 09257721
EISSN: None
Source Type: Journal
DOI: 10.1016/S0925-7721(97)00032-1 Document Type: Article |
Times cited : (18)
|
References (10)
|