메뉴 건너뛰기




Volumn 41, Issue 1-2, 2008, Pages 77-93

On the performance of the ICP algorithm

Author keywords

Hausdorff distance; ICP algorithm; Nearest neighbors; Pattern matching; RMS; Voronoi diagrams

Indexed keywords


EID: 84867946872     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2007.10.007     Document Type: Conference Paper
Times cited : (43)

References (10)
  • 1
    • 0002404105 scopus 로고    scopus 로고
    • Discrete geometric shapes: Matching, interpolation, and approximation
    • J.-R. Sack, J. Urrutia, Elsevier Amsterdam
    • H. Alt, and L. Guibas Discrete geometric shapes: matching, interpolation, and approximation J.-R. Sack, J. Urrutia, Handbook of Computational Geometry 1999 Elsevier Amsterdam 121 153
    • (1999) Handbook of Computational Geometry , pp. 121-153
    • Alt, H.1    Guibas, L.2
  • 5
    • 11244293701 scopus 로고    scopus 로고
    • How fast is the k-means method?
    • S. Har-Peled, and B. Sadri How fast is the k-means method? Algorithmica 41 3 2005 185 202
    • (2005) Algorithmica , vol.41 , Issue.3 , pp. 185-202
    • Har-Peled, S.1    Sadri, B.2
  • 7
    • 33748030481 scopus 로고    scopus 로고
    • Geometry and convergence analysis of algorithms for registration of 3D shapes
    • Geometry Preprint Series, TU Wien, June
    • H. Pottmann, Q.-X. Huang, Y.-L. Yang, S.-M. Hu, Geometry and convergence analysis of algorithms for registration of 3D shapes, Technical Report 117, Geometry Preprint Series, TU Wien, June 2004
    • (2004) Technical Report 117
    • Pottmann, H.1    Huang, Q.-X.2    Yang, Y.-L.3    Hu, S.-M.4


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