期刊文献+

栅格划分的二叉区间树节点构造算法 被引量:1

The Construction Algorithm of Binary Interval Tree Nodes based on Lattice Partition
下载PDF
导出
摘要 针对海量数据可视化过程中预处理时间长的问题,提出一种加速构造等值面提取索引结构的栅格构造算法.该算法以二叉区间树的span space划分为基础,利用栅格化方法对二叉区间树节点进行重构,降低了区间排序预处理计算规模,可将预处理效率提高50%左右.理论分析与实验证明,文中算法与传统最优算法有相近的活动单元搜索效率,能够大大缩短整个海量数据可视化过程,对实时性要求较高的可视化应用具有实际应用价值. To shorten the preprocessing of the iso-surface extraction from volume datasets,we propose a new algorithm for building binary interval tree nodes.Our approach employs the span space subdivision of a binary interval tree,and reconstructs the binary interval tree nodes by means of the lattice partition.The new scheme effectively reduces the complexity of the interval sorting in the preprocessing stage,and consequently shortens the preprocessing time by 50%.Experimental results and analysis verify that our approach achieves the similar efficiency as the conventional active-cell searching algorithm,and is especially practical for real-time visualization applications.
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2011年第7期1115-1122,共8页 Journal of Computer-Aided Design & Computer Graphics
基金 国家"九七三"重点基础研究发展计划项目(2009CB723803)
关键词 可视化 海量数据 二叉区间树 栅格 等值面提取 visualization large-scale data binary interval tree isosurface extraction
  • 相关文献

参考文献17

  • 1Lorensen W E, Cline H E. Marching cubes: a high resolution :3D surface construction algorithm [C] //Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH. New York: ACM Press, 1987: 163-169.
  • 2陈莉,竹岛由里子,藤代一成,彭群生.大规模数据场的并行可视化[J].浙江大学学报(理学版),2001,28(2):222-226. 被引量:5
  • 3Wilhehns J, van Gelder A. ()ctrees for faster isosurface generation [J]. ACM Transactions on Graphics, 1992, 11 (3) : 201-227.
  • 4Chiang Y J, Silva C T, Schroeder W J. Interactive out of-core isosurface extraction [C] //Proceedings of the Conference on Visualization. Los Alamitos: IEEE Computer Society Press, 1998:167-174.
  • 5Chiang Y J, Farias R, Silva C T, et at. A unified infrastructure for parallel out-of core isosurface extraction and volume rendering of unstructured grids [C] //Proceedings of IEEE Symposium on Parallel and Large-Data Vfsualfzation and Graphics. Piscataway: IEEE Computer Society Press, 2001:59-66.
  • 6Vrolijk B, Botha C P, Post F H. Fast time dependen't isosurface extraction and rendering [C] //Proceedings of the 20th Spring Conference on Computer Graphics. New York: ACM Press, 2004:45-54.
  • 7Shi Q M, JaJa J. Efficient time varying data using College Park: University Department, UMIACSTR isosurface extraction forlarge scale the persistent hyperoctree [R]. of Maryland. Computer Science 2006-01, 2006.
  • 8Sutton P M, Hansen C D. Accelerated isosurface extraction in time varying fields [J]. IEEE Transactions on Visualization and Computer Graphics, 2000, 6(2): 98-107.
  • 9Shi Q M, JaJa J. Isosurface extraction and spatial filtering using persistent octree [J]. IEEE Transactions on Visualization and Computer Graphics, 2006, 12 (5) : 1283 - 1290.
  • 10Aggarwal A, Jeffrey V S. The input/output complexity of sorting and related problems [J]. Communications of the ACM, 1988, 31(9): 1116-1127.

二级参考文献2

  • 1Chen L,Proceedings of the Third Int Symposium on High Performance Computing,2000年,10卷,537页
  • 2Chong M S,Phys Fluids Ann,1990年,2卷,5期,765页

共引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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