Incremental volume rendering using hierarchical compression

 

Show simple item record

dc.contributor.advisor Blake, Edwin H en_ZA
dc.contributor.author Haley, Michael Blake en_ZA
dc.date.accessioned 2016-01-02T04:52:35Z
dc.date.available 2016-01-02T04:52:35Z
dc.date.issued 1996 en_ZA
dc.identifier.citation Haley, M. 1996. Incremental volume rendering using hierarchical compression. University of Cape Town. en_ZA
dc.identifier.uri http://hdl.handle.net/11427/16140
dc.description Includes bibliographical references. en_ZA
dc.description.abstract The research has been based on the thesis that efficient volume rendering of datasets, contained on the Internet, can be achieved on average personal workstations. We present a new algorithm here for efficient incremental rendering of volumetric datasets. The primary goal of this algorithm is to give average workstations the ability to efficiently render volume data received over relatively low bandwidth network links in such a way that rapid user feedback is maintained. Common limitations of workstation rendering of volume data include: large memory overheads, the requirement of expensive rendering hardware, and high speed processing ability. The rendering algorithm presented here overcomes these problems by making use of the efficient Shear-Warp Factorisation method which does not require specialised graphics hardware. However the original Shear-Warp algorithm suffers from a high memory overhead and does not provide for incremental rendering which is required should rapid user feedback be maintained. Our algorithm represents the volumetric data using a hierarchical data structure which provides for the incremental classification and rendering of volume data. This exploits the multiscale nature of the octree data structure. The algorithm reduces the memory footprint of the original Shear-Warp Factorisation algorithm by a factor of more than two, while maintaining good rendering performance. These factors make our octree algorithm more suitable for implementation on average desktop workstations for the purposes of interactive exploration of volume models over a network. This dissertation covers the theory and practice of developing the octree based Shear-Warp algorithms, and then presents the results of extensive empirical testing. The results, using typical volume datasets, demonstrate the ability of the algorithm to achieve high rendering rates for both incremental rendering and standard rendering while reducing the runtime memory requirements. en_ZA
dc.language.iso eng en_ZA
dc.subject.other Computer Science en_ZA
dc.title Incremental volume rendering using hierarchical compression en_ZA
dc.type Master Thesis
uct.type.publication Research en_ZA
uct.type.resource Thesis en_ZA
dc.publisher.institution University of Cape Town
dc.publisher.faculty Faculty of Science en_ZA
dc.publisher.department Department of Computer Science en_ZA
dc.type.qualificationlevel Masters
dc.type.qualificationname MSc en_ZA
uct.type.filetype Text
uct.type.filetype Image
dc.identifier.apacitation Haley, M. B. (1996). <i>Incremental volume rendering using hierarchical compression</i>. (Thesis). University of Cape Town ,Faculty of Science ,Department of Computer Science. Retrieved from http://hdl.handle.net/11427/16140 en_ZA
dc.identifier.chicagocitation Haley, Michael Blake. <i>"Incremental volume rendering using hierarchical compression."</i> Thesis., University of Cape Town ,Faculty of Science ,Department of Computer Science, 1996. http://hdl.handle.net/11427/16140 en_ZA
dc.identifier.vancouvercitation Haley MB. Incremental volume rendering using hierarchical compression. [Thesis]. University of Cape Town ,Faculty of Science ,Department of Computer Science, 1996 [cited yyyy month dd]. Available from: http://hdl.handle.net/11427/16140 en_ZA
dc.identifier.ris TY - Thesis / Dissertation AU - Haley, Michael Blake AB - The research has been based on the thesis that efficient volume rendering of datasets, contained on the Internet, can be achieved on average personal workstations. We present a new algorithm here for efficient incremental rendering of volumetric datasets. The primary goal of this algorithm is to give average workstations the ability to efficiently render volume data received over relatively low bandwidth network links in such a way that rapid user feedback is maintained. Common limitations of workstation rendering of volume data include: large memory overheads, the requirement of expensive rendering hardware, and high speed processing ability. The rendering algorithm presented here overcomes these problems by making use of the efficient Shear-Warp Factorisation method which does not require specialised graphics hardware. However the original Shear-Warp algorithm suffers from a high memory overhead and does not provide for incremental rendering which is required should rapid user feedback be maintained. Our algorithm represents the volumetric data using a hierarchical data structure which provides for the incremental classification and rendering of volume data. This exploits the multiscale nature of the octree data structure. The algorithm reduces the memory footprint of the original Shear-Warp Factorisation algorithm by a factor of more than two, while maintaining good rendering performance. These factors make our octree algorithm more suitable for implementation on average desktop workstations for the purposes of interactive exploration of volume models over a network. This dissertation covers the theory and practice of developing the octree based Shear-Warp algorithms, and then presents the results of extensive empirical testing. The results, using typical volume datasets, demonstrate the ability of the algorithm to achieve high rendering rates for both incremental rendering and standard rendering while reducing the runtime memory requirements. DA - 1996 DB - OpenUCT DP - University of Cape Town LK - https://open.uct.ac.za PB - University of Cape Town PY - 1996 T1 - Incremental volume rendering using hierarchical compression TI - Incremental volume rendering using hierarchical compression UR - http://hdl.handle.net/11427/16140 ER - en_ZA


Files in this item

This item appears in the following Collection(s)

Show simple item record