期刊文献+

基于层次包围盒的车辆位置实时监控软件设计

Software of position monitoring based on bounding-volume hierarchies
下载PDF
导出
摘要 在车辆位置合法性实时判断中根据系统特点选用了层次包围盒化简运算。具体设计中首先提出了上位机和下位机协同工作的策略,引入了"适时终止"机制,并详细分析了算法的性能。通过实验证明此方法可以有效地解决在低成本车载端实现车辆位置实时监控的难题。 Based on the real-time judgment of vehicle location system,this paper uses bounding-volume hierarchies algorithm to simplify computation.In specific design,the strategy of how super ordination machine and lower place machine work together is provided firstly and concretely,then has led into "termination at the right moment " mechanism,and has analyzed the algorithmic function in detail.Experiment proves that this kind of method can solve difficult point realizing vehicle location real-time supervisory control in low cost vehicle equipment effectively.
出处 《计算机工程与应用》 CSCD 北大核心 2008年第4期92-93,215,共3页 Computer Engineering and Applications
关键词 层次包围盒 协同工作 空间换时间 适时终止 bounding-volume hierarchies cooperation space for time termination at the right moment
  • 相关文献

参考文献5

二级参考文献29

  • 1魏迎梅,王涌,吴泉源,石教英.碰撞检测中的层次包围盒方法[J].计算机应用,2000,20(S1):241-244. 被引量:38
  • 2S Gottschalk M C,Lin D Manocha. OBBTree:A Hierarchical Structure for Rapid Interference Detection[C].In:Proceedings of SIGGRAPH' 96,1996:171~180. 被引量:1
  • 3E G Gilbert,D W Johnson,S S Keerthi.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. 被引量:1
  • 4G van den Bergen.A fast and Robust GJK implementation for collision detection for convex objects[J].Journal of Graphics tools, 1997. 被引量:1
  • 5M Lin,J Canny.A fast algorithm for incremental distance calculation[C].In:IEEE Int Conf Robot Automat,Sacramento,CA, 1991:1008~1014. 被引量:1
  • 6Y Sato,M Hirata,T Maruyama et al.Efficient Collision Detection using Fast Distance-Calculation Algorithms for Convex and Non-Convex Objects[C].In:Proceedings for the 1996 IEEE International Conference on Robotics and Automation Minneapolis,Minnesota-April, 1996:771~778. 被引量:1
  • 7S Cameron.Enhancing GJK:Computing minimum and penetration distances between convex pllyhedra[C].In:Proc IEEE Int Conf On Robotics and Automation, 1997: 3112~3117. 被引量:1
  • 8Katsuaki Kawachi, Hiromasa Suzuki. Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions[C].In: Geometric Modeling and Processing, Hong Kong, China,2000. 被引量:1
  • 9Stephen Cameron. A Comparison of Two Fast Algorithms for Computing the Distance Between Convex Polyhedra[J].IEEE transactions on robotics and automation, 1997; 13 (6). 被引量:1
  • 10Brudea G,Coiffet P.Virtud Reality Technology[M].Published by John wiley & Sons Inc, New York, Chichester, Brisbane, et al, 1994, 157-189. 被引量:1

共引文献180

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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