期刊文献+

三维场景漫游中碰撞检测问题的研究与实现 被引量:5

The Research and Realization of the Collision Detection in Walkthrough in 3D Scene
在线阅读 下载PDF
导出
摘要 碰撞检测问题是三维场景漫游的技术难点。论文在对国内外已有碰撞检测算法进行分析比较的基础上,针对三维城市景观系统的数据特点,提出了基于回避三角形分割的二叉空间分割算法的碰撞检测算法。经实践证明,该算法对于场景漫游过程中产生的碰撞问题,可以进行快速有效地检测。 Collision detection is the choke point of roam in 3D scene.Aiming at the characteristic of date structure used in the system of 3D scene for city,the paper analyzes and compares many kinds of prevalent arithmetics domestic and outside,and then realizes the arithmetic based on binary space partition which avoids the partition of triangles and gives some optimization on it.In many experiments,this arithmetic can easily detect the collision when roaming,and can take the corresponding response.
作者 张唯 刘修国
出处 《计算机工程与应用》 CSCD 北大核心 2005年第19期67-69,176,共4页 Computer Engineering and Applications
关键词 BSP 树碰撞检测 虚拟现实技术 空间剖分 BSP tree,collision detection,technology of virtual reality,space subdivision
  • 相关文献

参考文献3

  • 1高春晓,刘玉树.碰撞检测技术综述[J].计算机工程与应用,2002,38(5):9-11. 被引量:28
  • 2刘长松 程连冀(译).3D图形编程指南[M].西北工业大学,1999.80-120.
  • 3Ganter M A,Isarankura B P.Dynamic collision detection using space partitionin[J].Journal of Mechanical Design,Transactions of the ASME,1993;115(1):150~155.

二级参考文献14

  • 1[1]Cameron S A.Collision detection by four-dimensional intersection testing[J].IEEE Trans Robotics and Automat,1990;6(3):291-302
  • 2[2]Hubbard P M.Collision Detection for Interactive Graphics Applications[J].IEEE Trans Visualization and Computer Graphics, 1995; 1 (3):218-230
  • 3[3]Bouma H' ,Vanecek G.Collision detection and analysis in a physical based simulation[C]Jn:Eurographies Workshop on Animation and Simu lation ,Vienna, 1991:191
  • 4[4]Thomas F,Torras C.Interference detection between non-convex polyhedra revisited with a practical aim[ClAn:Proceedings of the IEEE International Conference on Robotics and Automation,San Diegn,CA,1994: 587-594
  • 5[5]Chazelle B,Palios L. Decomposition algorithms in geometry[C].In :Bajaj C,ed.Algebraie Geometry and its Applications, Berlin Springer: 1994:419-447
  • 6[6]Boyse JW.lnterference detection among solids and surfaces[J].Communication of the Association of the Computing Machinery, 1979;22( 1 ):3-9
  • 7[7]Lin MC.Canny JF.A fast algorithm for incremental distance calcula-tion[C].In :Proceedings of the IEEE International Conference nn Ro-botics and Automation,Sacramento,CA, 1991: 1008-1014
  • 8[8]Chazelle B.Convex partitions of polyhedra:a lower bound and a worstcase optimal algorithm[J].SIAM Journal on Computing, 1984; 13:488-507
  • 9[9]Bajaj C,Dey T. Convex decomposition of polyhedra and robustness[J]. SIAM Journal on Computing, 1992;21(2) :339-364
  • 10[10]Gottschalk S,Lin M,Manocha D.OBB-Tree:A Hierarchical Structure for Rapid Interference Detection[C].In:Proceedings of ACM S1GGRA-PH 96, New Orlean: LA, 1996:171 - 180

共引文献28

同被引文献47

引证文献5

二级引证文献63

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部