메뉴 건너뛰기




Volumn 10, Issue 3, 1998, Pages 197-202

Getting around a lower bound for the minimum Hausdorff distance

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)
  • 1
    • 0000982419 scopus 로고
    • Applications of parametric searching in geometric optimization
    • P.K. Agarwal, M. Sharir, S. Toledo, Applications of parametric searching in geometric optimization, J. Algorithms 17 (1994) 292-318.
    • (1994) J. Algorithms , vol.17 , pp. 292-318
    • Agarwal, P.K.1    Sharir, M.2    Toledo, S.3
  • 4
    • 0001789615 scopus 로고
    • Finding kth paths and p-centers by generating and searching good data structures
    • G.N. Frederickson, D.B. Johnson, Finding kth paths and p-centers by generating and searching good data structures, J. Algorithms 4 (1983) 61-80.
    • (1983) J. Algorithms , vol.4 , pp. 61-80
    • Frederickson, G.N.1    Johnson, D.B.2
  • 6
    • 21144464462 scopus 로고
    • The upper envelope of Voronoi surfaces and its applications
    • D.P. Huttenlocher, K. Kedem, M. Sharir, The upper envelope of Voronoi surfaces and its applications, Discrete Comput. Geom. 9 (1993) 267-291.
    • (1993) Discrete Comput. Geom. , vol.9 , pp. 267-291
    • Huttenlocher, D.P.1    Kedem, K.2    Sharir, M.3
  • 7
    • 7544245726 scopus 로고
    • On the union of jordan regions and collision-free translational motion amidst polygonal obstacles
    • K. Kedem, R. Livne, J. Pach, M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete Comput. Geom. 1 (1986) 59-72.
    • (1986) Discrete Comput. Geom. , vol.1 , pp. 59-72
    • Kedem, K.1    Livne, R.2    Pach, J.3    Sharir, M.4
  • 9
    • 0026406169 scopus 로고
    • New upper bounds in Klee's measure problem
    • M.H. Overmars, C.K. Yap, New Upper Bounds in Klee's measure problem, SIAM J. Comput. 6 (20) (1991) 1034-1045.
    • (1991) SIAM J. Comput. , vol.6 , Issue.20 , pp. 1034-1045
    • Overmars, M.H.1    Yap, C.K.2


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