首页 | 本学科首页   官方微博 | 高级检索  
     

重叠网格预处理技术研究
引用本文:刘鑫,陆林生.重叠网格预处理技术研究[J].计算机工程与应用,2006,42(1):23-26,30.
作者姓名:刘鑫  陆林生
作者单位:江南计算技术研究所,江苏,无锡,214083
基金项目:中国科学院资助项目;国家科技攻关项目
摘    要:论文主要讨论重叠网格预处理方法,并提出迷路算法应用于“挖洞”过程,为重叠网格预处理提供了高效、可靠的“挖洞”方法,算法复杂度低,实现简单,健壮性好;在多层次嵌套重叠方面,引入了重叠网格主从关系图有效解决多层次嵌套重叠带来的问题;在提高找重效率方面,建立基于网格的kd树加快了找重过程。实验结果表明在大网格量、复杂重叠区域时该重叠网格预处理技术仍能得到较理想的效率。

关 键 词:迷路算法  重叠网格主从关系图  基于网格的KD树
文章编号:1002-8331-(2006)01-0023-04

A Research on Overset Mesh Pre-processing Technology
Liu Xin,Lu Linsheng.A Research on Overset Mesh Pre-processing Technology[J].Computer Engineering and Applications,2006,42(1):23-26,30.
Authors:Liu Xin  Lu Linsheng
Affiliation:Jiangnan Institute of Computing Technology,Wuxi,Jiangsu 214083
Abstract:This paper mainly discusses the overset mesh pre-proeessing technology,and supplies a new efficient and robust hole-cutting algorithm applied in the overset mesh preprocessing,which is based on maze algorithm and can be easily implemented with low complexity.Then the paper brings forward the overset relationship graph to deal with the problems brought by multi-level overset grids.Finally,to increase the intersection efficiency,the grid-based kd tree is introduced.Experiment results show that even in the case of complicated overset areas of large grids number,the overset preprocessing technology can get good performance.
Keywords:maze algorithm  overset relationship graph  grid-based KD tree
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号