Lin M C,Canny J F.Fast algorithm for incremental distance calculation[A].In:Proceeding of IEEE International Conference on Robotics and Automation[C],Sacramento,USA,1991:1008 ～1014.
[2]
Bergen G,Proximity queries and penetration depth computation on 3D game objects[A].In:Proceedings of Game Developers Conference[C],San Jose,USA,2001:821 ～837.
[3]
Kim Y J,Otaduy M A,Lin M C.Fast penetration depth computation for physically-based animation[A].In:Proceeding of ACM SIGGRAPH Symposium on Computer Animation[C],New York,USA:ACM Press,2002:23 ～ 32.
[4]
Kim Y J,Lin M C,Monocha D.Incremental penetration depth estimation between convex polytopes using dual-space expansion[J].IEEE Transactions on Visualization and Computer Graphics,2004,10(2):152 ～ 163.
[5]
Ong C J.A fast growth distance algorithm for incremental motions[J].IEEE Transactions on Robotics and Automation,2000,16(6):880 ～ 890.
[6]
Shih C L,Liu J Y.Computing the minimum directed distances between convex polyhedra[J].Journal of Information Science and Engineering,1999,15 (3):353 ～ 373.
[7]
Heckbert P S.Graphics Gems Ⅳ[M],Boston:Academic Press,1994.
[8]
Bennett K P,Mangasarian O L.Neural Network Training via Linear Programming[R].TR948,Wisconsin,Madison,USA:Department of Computer Science,University of Wisconsin-Madison,1990.
[9]
Cameron S A,Culley R K.Determining the minimum translation distance between two convex polyhedra[A].In:Proceeding of IEEE International Conference of Robot and Automations[C],San Francisco,CA,USA,1986:591 ～ 596.
[10]
Gilbert E G,Johnson D W,Keerthi S S.A fast procedure for computing the distance between complex objects in three-dimensional space[J].IEEE Journal of Robotics and Automation,1988,4 (2):193 ～ 203.
[11]
Kim Y J,Otaduy M A,Lin M C.Fast Penetration Depth Computation Using Rasterization Hardware and Hierarchical Refinement[R].TR02-014,North Carolina,Chapel Hill,USA:Department of Computer Science,University of North Carolina,2002.
[12]
Zhu Xiang-yang,Ding Han,Xiong You-lun.The pseudo minimum translational distance between convex polyhedral:definitions and properties[J].Science in China (Series E),2001,31 (2):128～136.[朱向阳,丁汉,熊有伦.凸多面体之间的伪最小平移距离-Ⅰ.定义及其性质[J].中国科学(E辑),2001,31(2):128～136.]
[13]
Sridharan K.Efficient computation of a measure of depth between convex objects for graphics applications[J].Computers & Graphics,2002,26(5):785 ～793.
[14]
Yuan J.A neural network measuring the intersection of m-dimensional convex polyhedra[J].Automatica,1995,31 (4):517 ～531.
[15]
LINDO API 4.0[CP/OL].Http://www.Lindo.Com/downloads/LAPI-WINDOWS-IA32-4.0.Zip,2005-05 -23.
