| Residential College | false |
| Status | 已發表Published |
| Fast combinative volume rendering by indexed data structure | |
| Sun W.1; Wang W.1; Wu E.1 | |
| 2001-12-01 | |
| Source Publication | Progress in Natural Science
 |
| ISSN | 10020071 |
| Volume | 11Issue:12Pages:922-923 |
| Abstract | It is beneficial to study the interesting contents in a data set by combining and rendering various contents 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. |
| Keyword | Combinative volume rendering Data structure Data visualization |
| URL | View the original |
| Language | 英語English |
| Fulltext Access | |
| Document Type | Journal article |
| Collection | University of Macau |
| Affiliation | 1.Institute of Software Chinese Academy of Sciences 2.Universidade de Macau |
| Recommended Citation GB/T 7714 | Sun W.,Wang W.,Wu E.. Fast combinative volume rendering by indexed data structure[J]. Progress in Natural Science, 2001, 11(12), 922-923. |
| APA | Sun W.., Wang W.., & Wu E. (2001). Fast combinative volume rendering by indexed data structure. Progress in Natural Science, 11(12), 922-923. |
| MLA | Sun W.,et al."Fast combinative volume rendering by indexed data structure".Progress in Natural Science 11.12(2001):922-923. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment