[1] 尹长林,喻定权.一种基于拓扑搜索的三角网求交算法[J].计算机工程与应用,2006,42(36):209-211. [2] 蒋钱平,唐 杰,袁春风.基于平均单元格的三角网格曲面快速求交算法[J].计算机工程,2008,34(21):172-174. [3] 张少丽,王毅刚,陈小雕.基于空间分解的三角网格模型求交方法[J].计算机应用,2009,29(10):2671-2673. [4] 陈学工,马金金,邱 华,等.三维网格模型的稳定布尔运算算法[J].计算机应用,2011,31(5):1198-1201. [5] 吴立新,史文中.地理信息系统原理与算法[M].北京:科学出版社,2003. [6] 邬 伦,刘 瑜,张 晶,等.地理信息系统:原理、方法和应用[M].北京:科学出版社,2001.
[7] Lo S H,Wang W X.A Fast Robust Algorithm for the Intersection of Triangulated Surfaces[J].Engineering with Computers,2004,20(1):11-21. [8] 马登武,叶 文,李 瑛.基于包围盒的碰撞检测算法综述[J].系统仿真学报,2006,18(4):1058-1061. [9] Gino van den Bergen.Efficient Collision Detection of Complex Deformable Models Using AABB Trees[J].Journal of Graphics Tools,1997,2(4):1-13. [10] Hubbard P M.Collision Detection for Interactive Graphics Applications[J].IEEE Transactions on Visualization and Computer Graphics,1995,1(3):218-230. [11] Gottschalk S,Lin M C,Manocha D.OBBTree:A Hierarchical Structure for Rapid Interference De-tection[C]//Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques.New York,USA:ACM Press,1996:171-180. [12] Zachmann G.Rapid Collision Detection by Dynamically Aligned DOP-trees[C]//Proceedings of Virtual Reality Annual International Symposium.Washington D.C.,USA:IEEE Press,1998:90-97. [13] Klosowski J T,Held M,Mitchell J S B,et al.Efficient Collision Detection Using Bounding Volume Hierarchies of K-dops[J].IEEE Transactions on Visualization and Computer Graphics,1998,4(1):21-36. [14] Christer E.Real-time Collision Detection[M].San Fran-cisco,USA:Elsevier/Morgan Kaufmann Publishers,2005. [15] 初 剑,魏志强,孟祥宾,等.基于Delaunay三角剖分的曲面求交技术[J].系统仿真学报,2009,21(z1):155-158. [16] Tomas M.A Fast Triangle-triangle Intersection Test[J].Journal of Graphics Tools,1997,2(2):25-30. [17] Philip J S,David H.计算机图形学几何工具算法详解[M].周长发,译.北京:电子工业出版社,2005. |