Share Email Print
cover

Proceedings Paper

A mesh simplification algorithm based on vertex importance and hierarchical clustering tree
Author(s): Yin Chao; Wang Jiateng; Qiu Guoqing; Dong Kun
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In order to improve the efficiency of rendering terrain based on digital elevation model (DEM), a mesh simplification algorithm based on vertex importance and hierarchical clustering tree is presented. The vertexes of terrain blocks are firstly trained using K-means clustering analysis, and then we select representative vertexes of each cluster according to vertex importance. Secondly, coarse meshes are constructed on the basis of these representative vertexes. Thirdly, we seam all coarse meshes. Finally, repeat the above steps until we accomplish the whole simplification process. For the new insertion point, a hierarchical clustering tree is used to record intermediate results, which is applied to view dependent rendering for terrain. Experiment show that, the algorithm improves the efficiency and reduces memory consumption. At the same time, it maintains geometric characteristics of terrain.

Paper Details

Date Published: 29 August 2016
PDF: 7 pages
Proc. SPIE 10033, Eighth International Conference on Digital Image Processing (ICDIP 2016), 1003364 (29 August 2016); doi: 10.1117/12.2244921
Show Author Affiliations
Yin Chao, PLA Univ. of Science and Technology (China)
Wang Jiateng, PLA Univ. of Science and Technology (China)
Qiu Guoqing, PLA Univ. of Science and Technology (China)
Dong Kun, PLA Univ. of Science and Technology (China)


Published in SPIE Proceedings Vol. 10033:
Eighth International Conference on Digital Image Processing (ICDIP 2016)
Charles M. Falco; Xudong Jiang, Editor(s)

© SPIE. Terms of Use
Back to Top