Optimization and Implementation of Unstructured Grid Volume Rendering Algorithm

DOI

10.2991/iccasm.2012.373How to use a DOI?

Keywords

Volume rendering, Unstructured grids, Fragment,k-buffer

Abstract

Visibility sorting is one of the key techniques in volume rendering of unstructured grids. The efficiency of sorting algorithm greatly affects the efficiency of volume rendering. Hardware-Assisted Visibility Sorting [1] (HAVS) is one of the most important volume rendering algorithms. This paper proposes an optimization algorithm of HAVS by keeping a sorted list which could decrease the comparing time in the fragment-level sorting process of k-buffer. The range of k is also analyzed by experiments. The results of experiment show that the proposed optimization algorithm obviously improves the efficiency of HAVS.

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jian Hu
AU  - Wenke Wang
AU  - Qianli Ma
AU  - Sikun Li
PY  - 2012/08
DA  - 2012/08
TI  - Optimization and Implementation of Unstructured Grid Volume Rendering Algorithm
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 1458
EP  - 1461
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.373
DO  - 10.2991/iccasm.2012.373
ID  - Hu2012/08
ER  -