期刊文献+

一种空间数据结构加速的顶点与地形实时交互算法 被引量:1

A Real-time Interaction Algorithm for Vertex and Terrain Accelerated by Spatial Data Structure
下载PDF
导出
摘要 针对动态场景的实时交互式渲染中,离散碰撞检测算法导致的“穿模”现象,提出一种新的顶点与地形实时交互算法,并利用空间数据结构进行加速。算法利用顶点与模型表面多边形的空间位置关系,首先计算顶点在当前模型移动后的位置,然后计算本次移动与其他模型的相交情况,将移动沿路径依次分解到每个经过的面上,以此计算移动轨迹与终点位置。算法可通过层次包围盒、八叉树、KD树等各类现有的空间数据结构进行加速。使用八叉树,设计并实现了简易的场景漫游与寻路,以此为实验环境进行性能分析。实验数据证明,该方法能够满足实时性的要求,并且具有较高精度。 For real-time interactive rendering of dynamic scenes,the phenomenon of mutual penetration or superposition of objects caused by discrete collision detection algorithms,this paper proposes a new real-time interaction algorithm between vertex and terrain,and accelerates with spatial data structure.The algorithm uses the spatial positional relationship between the vertex and the surface polygon of the model.Firstly,the position of the vertex after the current model is moved is calculated.Then,the intersection of the current movement and other models is calculated,and the movement is sequentially decomposed along the path to each passing surface to This calculates the movement path and the end position.The algorithm can be accelerated by various existing spatial data structures such as bounding volume hierarchies,octrees,and KD trees.In this paper,we use octree to design and implement simple scene roaming and pathfinding to analyze the performance of the experimental environment.The experimental data proves that the method can meet the requirements of real- time and has high precision.
作者 邹刘磊 徐安琦 张震 朱洪锦 范洪辉 ZOU Liu-lei;XU An-qi;ZHANG Zhen;ZHU Hong-jin;FAN Hong-hui(School of Computer Engineering,Jiangsu University of Technology,Changzhou 213001,China)
出处 《江苏理工学院学报》 2019年第2期49-53,共5页 Journal of Jiangsu University of Technology
基金 大学生创新创业训练计划项目“基于Real-Time Ray Tracing的编程语言教学系统”(201811463007Z)
关键词 实时交互式渲染 空间数据结构 碰撞检测 real-time interactive rendering spatial data structure collision detection
  • 相关文献

参考文献5

二级参考文献52

  • 1陆旻丰,吴杭彬,刘春,李楠.地面三维激光扫描数据缺失分类及成因分析[J].遥感信息,2013,28(6):82-86. 被引量:13
  • 2马登武,叶文,李瑛.基于包围盒的碰撞检测算法综述[J].系统仿真学报,2006,18(4):1058-1061. 被引量:111
  • 3张洁,岳玮宁,王楠,汪国平.三角网格模型的各向异性孔洞修补算法[J].计算机辅助设计与图形学学报,2007,19(7):892-897. 被引量:24
  • 4[1]V Gaede , O Gunther.Multidimentional Access Methods[J].Computing Surveys,1998,30(2):170- 231.
  • 5[2]J P Peloux,et al.Evaluation of Spatial Indices Implemented with the DBMS O2[EB/OL].Gemo Report Number 69,Ingenierie des Systemes d'Information,1995,http://osage.inria.fr/verso/Gemo/PUBLI/all-byyear.php,2001- 06.
  • 6[3]Hoel E G,et al.A Qualitative Comparison Study of Data Structures for Large Segment Databases[C].Proc.ACM SIGMOD Int.Conf.on Management of Data,1992.205- 214.
  • 7[4]Guttman A.R-trees: A Dynamic Index Structure for Spatial Searching[C].Proc.ACM SIGMOD International Conference on Management of Data,1984.47- 57.
  • 8[5]Beckman N H,P Krigel,R Schneider,et al.The R*-tree:An Efficient and Robust Access Method for Points and Rectangles[C].Proc.ACM SIGMOD International Conference on Management of Data,1990.322- 331.
  • 9[6]Smith T R,P Gao.Experimental Performance Evaluations on Spatial Access Methods[C].Proc.4th Int.Symp.on Spatial Data Handling,Zurich,1990.991- 1002.
  • 10[7]Hutflesz A,H W Six,P Widmayer.Globally Order Preserving Multidimensional Linear Hashing[C].Proc.4th IEEE Int.Conf.on Data Eng.,1988.572- 579.

共引文献25

同被引文献3

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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