메뉴 건너뛰기




Volumn 5, Issue 3, 1999, Pages 241-253

An Accurate Distance-Calculation Algorithm for Convex Polyhedra

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0345761070     PISSN: 13853139     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009924204609     Document Type: Article
Times cited : (4)

References (10)
  • 1
    • 0024673745 scopus 로고
    • A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra
    • Bobrow, J. E.: A Direct Minimization Approach for Obtaining the Distance Between Convex Polyhedra, The International Journal of Robotics Research 8 (3) (1989), pp. 65-76.
    • (1989) The International Journal of Robotics Research , vol.8 , Issue.3 , pp. 65-76
    • Bobrow, J.E.1
  • 2
    • 0346383261 scopus 로고
    • A Fast Algorithm for Computing the Distance between Two Convex Polyhedra
    • Chen, Liang, Huang, Wen Qi, and Song, En Min: A Fast Algorithm for Computing the Distance between Two Convex Polyhedra, Math. J. Chinese Univ. 16 (4) (1994), pp. 345-359.
    • (1994) Math. J. Chinese Univ. , vol.16 , Issue.4 , pp. 345-359
    • Chen, L.1    Huang, W.Q.2    Song, E.M.3
  • 3
    • 60749130749 scopus 로고
    • Determining the Separation of Preprocessed Polyhedra - A Unified Approach
    • Automata, Languages and Programming (Coventry, 1990), Springer, New York
    • Dobkin, D. and Kirkpatrick, D.: Determining the Separation of Preprocessed Polyhedra - A Unified Approach, in: Automata, Languages and Programming (Coventry, 1990), Lecture Notes in Computer Science 443, Springer, New York, 1990, pp. 400-413.
    • (1990) Lecture Notes in Computer Science , vol.443 , pp. 400-413
    • Dobkin, D.1    Kirkpatrick, D.2
  • 4
    • 0027610383 scopus 로고
    • Computing the Intersection-Depth of Polyhedra
    • Dobkin, D., Hershberger, J., Kirkpatrick, D., and Suri, S.: Computing the Intersection-Depth of Polyhedra, Algorithmica 9 (6) (1993), pp. 528-533.
    • (1993) Algorithmica , vol.9 , Issue.6 , pp. 528-533
    • Dobkin, D.1    Hershberger, J.2    Kirkpatrick, D.3    Suri, S.4
  • 6
    • 0023998710 scopus 로고
    • A Fast Procedure for Computing the Distance between Complex Objects in Three-Dimensional Space
    • Gilbert, E. G., Johnson, D. W., and Keerthi S. S.: A Fast Procedure for Computing the Distance Between Complex Objects in Three-Dimensional Space, IEEE Journal of Robotics and Automation 4 (2) (1988), pp. 193-203.
    • (1988) IEEE Journal of Robotics and Automation , vol.4 , Issue.2 , pp. 193-203
    • Gilbert, E.G.1    Johnson, D.W.2    Keerthi, S.S.3
  • 8
    • 0027964031 scopus 로고
    • Efficient Distance Computation between Non-Convex Objects
    • Quinlan, S.: Efficient Distance Computation Between Non-Convex Objects, in: IEEE Intern. Conf. on Robotics and Automation, 1994, pp. 3324-3329.
    • (1994) IEEE Intern. Conf. on Robotics and Automation , pp. 3324-3329
    • Quinlan, S.1
  • 9
    • 0029720595 scopus 로고    scopus 로고
    • Efficient Collision Detection Using Fast Distance-Calculation Algorithms for Convex and Non-Convex Objects
    • Minneapolis, Minnesota
    • Sato, Y., Hirata, M., Maruyama, T., and Arita, Y.: Efficient Collision Detection Using Fast Distance-Calculation Algorithms for Convex and Non-Convex Objects, in: Proc. IEEE Intern. Conf. on Robotics and Automation, Minneapolis, Minnesota, 1996, pp. 771-778.
    • (1996) Proc. IEEE Intern. Conf. on Robotics and Automation , pp. 771-778
    • Sato, Y.1    Hirata, M.2    Maruyama, T.3    Arita, Y.4


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