期刊文献+

基于扫掠球量的快速距离计算 被引量:2

Fast Distance Computation Based on Swept Sphere Volumes
下载PDF
导出
摘要 引入扫掠球量作为包围量。扫掠球是一系列相对于核基本形状以某一等距向外扩展而形成的包围量。核基本形状包括点,线段和矩形。这些包围量可以提供对被包围物体的不同的紧密性。基于这些包围量,建立混合层次并且采用有效而准确的算法可以计算两物体之间的距离,并可通过在返回值中引入相对误差来进一步提高算法效率。 A family of bounding volumes called swept sphere volumes is introduced. It corresponds to a core primitive shape grown outward by some offset. The core primitives include point, line and rectangle. This family of bounding volumes provides varying tightness to the underlying geometry, furthermore, hybrid hierarchies are built and an efficient and accurate algorithm to perform distance computation using those volumes is provided. The efficiency of the algorithm can be further improved by accepting a relative error in the returned result.
出处 《工程图学学报》 CSCD 北大核心 2007年第6期102-106,共5页 Journal of Engineering Graphics
基金 江苏省自然科学基金资助项目(bk2003017)
关键词 计算机应用 距离计算 扫掠球量 多面体 computer application distance computation swept sphere volumes polyhedron
  • 相关文献

参考文献14

  • 1Lumelsky V J. On fast computation of distance between line segments [J]. Information Processing, 1985, 21 (4): 55-61
  • 2Gilbert 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.
  • 3Ling M C, Canny J E A fast algorithms for obtaining the distance between convex polyhedra [A]. In: proc. of IEEE International Conference on Robotics and Automation[C]. 1991. 1008-1004.
  • 4周水生,容晓锋,周利华.计算两个凸多面体间距离的一个新算法[J].苏州科技学院学报(自然科学版),2003,20(2):11-16. 被引量:2
  • 5Fares C, Hamam Y. Collision detection for rigid bodys: a state of the art view [A]. In: Proceedings of the Eurosim04 [C]. ESIEE Paris, France, 2005.33-38.
  • 6Quinlan S. Efficient distance computation between non-convex objects [A]. In: Proc. of IEEE International Conference on Robotics and Automation [C]. 1994. 3324-3329.
  • 7Johnson D, Cohen E. A framework for efficient minimum distance computation [A]. In: IEEE Conference on Robotics and Automation [C]. 1998. 3678-3683.
  • 8Hudson T, Lin M, Cohen J, et al. V-collide: Accelerated collision detection for vrml [A]. In: Proc. of VRML Conference [C]. 1997. 119-125.
  • 9Larsen E, Gottschalk Ming S, Lin C, et al. Fast proximity queries with swept sphere volumes [R]. Technical Report, Dept. of Computer Science, Univ. of North Carolina Chapel Hill, 1999. 1-32.
  • 10Funfzig C, Ullrich T, Fellner D W. Hierarchical spherical distance fields for collision detection [J]. IEEE Computer Graphics and Applications, 2006, 15(3): 64-74.

二级参考文献14

  • 1陈亮,黄文奇,宋恩民.求两凸多面体间距离的快速算法[J].高等学校计算数学学报,1994,16(4):345-359. 被引量:2
  • 2方述诚 S普森普拉(汪定伟 王梦光译).线性规划及其扩展:理论与算法[M].北京:科学出版社,1993..
  • 3Canny John. Collision detection for moving polyhedra[J]. IEEE trans, on Pattern Analysis and Machine Intelligence,1986,8(2): 200-209.
  • 4Mehrotra S. On the implementation of a primal-dual interior point method[J]. SIAM J on Optimization, 1992,2:575-601.
  • 5Fang S C, Tsao H S. On the entropic perturbation and exponential penalty methods for linear programming[J]. J Optimization Theory and Applications , 1996,89(2):461-466.
  • 6Cotin S, Delingette H, Ayache N. Real-time Elastic Deformation of Soft Tissues for Surgery Simulations[J]. IEEE Transactions on Visualization and Computer Graphics, 1999,5 ( 1 ): 62-73.
  • 7Ballard D H. Strip trees: A hierarchical representation for curves[J]. ACM Communication, 1981, 24(5): 310-321.
  • 8Barequet G B, Chazelle L, Guibas J, Mitchell, Tal A.BOXTREE: A hierarchical representation for surfaces in 3D[J]. Computer Graphics Forum, 1996, 15(3): C387-C396, C484.
  • 9Gottschalk S, Lin M, Manocha D. OBBTree: A Hierarchical Structure for Rapid Interference Detection[J]. Proceedings of SIGGRAPH'96, 1996: 171-180.
  • 10邓文平 熊岳山 李思昆.八叉树层次包围盒碰撞检测算法的快速实现.系统仿真学报,2003,15:158-160.

共引文献1

同被引文献15

引证文献2

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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