期刊文献+

二维矢量场周期轨道高效提取方法

Efficient Extraction of Periodic Orbits in Two-Dimensional Vector Field
下载PDF
导出
摘要 针对现有周期轨道提取效率较低的问题,提出了一种高效提取周期轨道的方法.在网格环方法基础上,通过减少可能生成封闭流线的候选种子点数目,有效地缩短备选流线的生成时间;然后根据流线的不相交性,进一步减少备选流线周围需要测试的网格点数目,从而有效地提高周期轨道提取的效率.在Windows64位操作系统,i5-2.20GHz CPU,4 GB内存的PC机上对范德波尔函数解析数据和实测湍流数据进行了实验,结果表明,与网格环方法相比,该方法可以节省90%以上的计算时间. In order to improve the efficiency of periodic orbit extraction,this paper proposes an efficient method for periodic orbit extraction in 2D.Based on the cell cycle method,this paper reduces the generation time of the candidate streamlines by reducing the number of candidate seed points that may generate closed streamlines.Then the efficiency of the periodic orbit extraction is further improved by reducing the number of grid points needed to be tested around the candidate streamlines according to the nature that two streamlines cannot intersect with each other.The analytical data of van der Pol’s equation and the measured turbulence data are tested on the Windows 64-bit operating system,i5-2.20 GHz CPU and 4GB memory PC.The experimental results show that the proposed method can save more than 90%computing time compared with the cell cycle method.
作者 王文珂 郝江聪 Wang Wenke;Hao Jiangcong(College of Meteorology and Oceanology,National University of Defense Technology,Changsha 410073;College of Computer,National University of Defense Technology,Changsha 410073)
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2019年第9期1568-1573,共6页 Journal of Computer-Aided Design & Computer Graphics
基金 国家自然科学基金(61972411) 国家“九七三”重点基础研究发展计划(2015CB755604)
关键词 周期轨道 二维矢量场 极限环 封闭流线 periodic orbits two-dimensional vector field limit cycles closed streamline
  • 相关文献

参考文献1

二级参考文献22

  • 1刘占平,汪国平,董士海.ProLIC:一种累进的矢量场可视化方法[J].系统仿真学报,2001,13(S2):256-259. 被引量:7
  • 2唐泽圣. 3D 数据场可视化[M]. 北京: 清华大学出版社, 1999:163-167.
  • 3Charles D H, Chris R J. The visualization handbook[M]. Amsterdam:Elsevier, 2005.
  • 4Li L, Hsien H H, Shen H W. Illustrative streamline placementand visualization[C] //Proceedings of the IEEE Pacific VisualizationSymposium. Los Alamitos: IEEE Computer Society Press,2008: 79-86.
  • 5Krishnan H, Garth C, Joy K I. Time and streak surfaces forflow visualization in large time-varying data sets[J]. IEEETransactions on Visualization and Computer Graphics, 2009,15(6): 1267-1274.
  • 6van Wijk J J. Spot noise: texture synthesis for data visualization[J]. ACM SIGGRAPH Computer Graphics, 1991, 25(4):309-318.
  • 7de Leeuw W C, van Wijk J J. Enhanced spot noise for vectorfield visualization[C] //Proceedings of the 6th IEEE Conference onVisualization. Los Alamitos: IEEE Computer Society Press, 1995:233-239.
  • 8de Leeuw W C. Divide and conquer spot noise[C] //Proceedingsof the ACM/IEEE Conference on Supercomputing. New York:ACM Press, 1997: 1-13.
  • 9Max N, Becker B. Flow visualization using moving textures[C]//Proceedings of the ICASW/LaRC Symposium on VisualizingTime-Varying Data. Dordrecht: Kluwer Academic Publishers,1995: 77-87.
  • 10Jobard B, Erlebacher G, Hussaini M. Lagrangian-eulerian advectionfor unsteady flow visualization[J]. IEEE Transactionson Visualization and Computer Graphics, 2002, 8(3): 211-222.

共引文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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