摘要
针对海量数据可视化过程中预处理时间长的问题,提出一种加速构造等值面提取索引结构的栅格构造算法.该算法以二叉区间树的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
