关键词: 可视化, 层次细节模型（LOD）, 渐进网格, 区域分解, 并行计算

Abstract: To solve the problem of fast rendering large-scale visual data, a parallel dynamic level-of-detail construct algorithm based on domain decomposition is presented. The main contributions of this article are presented as follows. Firstly, the traditional progressive mesh algorithm is improved by using quadric error metric method, to provide faster implementation. Then, a self-adaptive domain decomposition algorithm based on model’s bounding box is put forward for cutting the original model into several blocks for parallel computing. Finally, a parallel dynamic level-of-detail construct algorithm by executing progressive mesh algorithm on the blocks in parallel is presented. As a result, this algorithm can generate high-qualified level-of-detail models, and has ideal speed-up ratio and expansibility. Compared to serial algorithms, this algorithm greatly reduces the execution time.

Key words: visualization, Level-Of-Detail（LOD）, progressive mesh, domain decomposition, parallel computing