Skip to main navigation Skip to main content
  • E-Submission

JKSPE : Journal of the Korean Society for Precision Engineering

OPEN ACCESS
ABOUT
BROWSE ARTICLES
EDITORIAL POLICIES
FOR CONTRIBUTORS
Article

삼차원 공간에서 구 다면체 사이의 최소거리 계산을 위한 효율적인 알고리즘의 개발

오재윤, 김기호

Development of an Efficient Algorithm for the Minimum Distance Calculation between two Polyhedra in Three-Dimensional Space

Chae-Youn Oh, Ki-Ho Kim
JKSPE 1998;15(11):130-136.
Published online: November 1, 1998
  • 6 Views
  • 0 Download
  • 0 Crossref
  • 0 Scopus
prev next

Download Citation

Download a citation file in RIS format that can be imported by all major citation management software, including EndNote, ProCite, RefWorks, and Reference Manager.

Format:

Include:

Development of an Efficient Algorithm for the Minimum Distance Calculation between two Polyhedra in Three-Dimensional Space
J. Korean Soc. Precis. Eng.. 1998;15(11):130-136.   Published online November 1, 1998
Download Citation

Download a citation file in RIS format that can be imported by all major citation management software, including EndNote, ProCite, RefWorks, and Reference Manager.

Format:
Include:
Development of an Efficient Algorithm for the Minimum Distance Calculation between two Polyhedra in Three-Dimensional Space
J. Korean Soc. Precis. Eng.. 1998;15(11):130-136.   Published online November 1, 1998
Close