Fast combinative volume rendering by indexed data structure

It is beneficial to study the interesting contents in a data set by combining and rendering variouscontents of the data. In this regard, an indexed data structure is proposed to facilitate the reorganization of data so that the contents of the data can be combined conveniently and only the selected contents in the data are processed for rendering. Based on the structure, the cells of different contents can be queued up easily so that the volume rendering can be conducted more accurately and quickly. Experimental results show that the indexed data structure is very efficient in improving combinative volume rendering.