计算两圆环面之间最近距离.pdfVIP

23 2 Vol.23 No. 2 2011 2 Journal of Computer-Aided Design Computer Graphics eb. 2011 1, 2, 3, 4, 5) 1, 4, 5) 3) 1, 4, 5) 刘晓明 , 刘长远 , 胡 强 , 雍俊海 1) ( 100084) 2) ( 100084) 3) ( 102205) 4) ( 100084) 5) ( 100084) ( xm- liu06@ mails. tsinghua. edu. cn) : . 3 , . Hausdorff , ; , H ausdorff . , H ausdorff , . . : H ausdorff ; ; : T P391. 72 Computing the Minimum Distance between Two Tori 1, 2, 3, 4, 5) 1, 4, 5) 3) 1, 4, 5) Liu Xiaoming , Liu Changyuan , Hu Qiang , and Yong Junhai 1) (School of Sof tware, Tsinghua University , Beij ing 100084) 2) (Dep artment of Comp uter Science and Technology , Tsinghua University , Beij ing 100084) 3) (Dep artment One, Command and ng ineering College of Chemical Def ense, Beij ing 102205) 4) (Key Laboratory f or I nf ormation System Security , Ministry of ducation, Beij ing 100084) 5) ( Tsinghua National Laboratory f or I nf ormation Science and Technology , Beij ing 100084) Abstract: T he minimal distance computing between two tori is the basis of their collision detection and intersection. A method is proposed for discriminating three types of position relationship ( i. e. , inclusion, disjunction and intersection) between two tori, and for computing their minimal distance. This paper proves that the H ausdorff distance between two circles in three-dimensional space can be obtained by computing their collinear normal points, which can be calculated by solving an equation of degree 8. With classification and comparison of the collinear no