메뉴 건너뛰기




Volumn 38, Issue 3, 1991, Pages 123-127

Computing the minimum Hausdorff distance between two point sets on a line under translation

Author keywords

Computational geometry; Hausdorff distance; pattern matching; pattern recognition

Indexed keywords

COMPUTER VISION; MATHEMATICAL TECHNIQUES - GEOMETRY; PATTERN RECOGNITION;

EID: 0026153079     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(91)90233-8     Document Type: Article
Times cited : (192)

References (8)
  • 6
    • 0023012607 scopus 로고
    • Geometric complexity of some location problems
    • (1986) Algorithmica , vol.1 , pp. 193-212
    • Lee1    Wu2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.