|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
16th IEEE Visualization 2005 (VIS 2005)
Distributed Data Management for Large Volume Visualization
Minneapolis, Minnesota
October 23-October 28
ISBN: 0-7803-9462-3
| ASCII Text | x | ||
| Jinzhu Gao, Jian Huang, C. Ryan Johnson, Scott Atchley, James Arthur Kohl, "Distributed Data Management for Large Volume Visualization," Visualization Conference, IEEE, pp. 24, 16th IEEE Visualization 2005 (VIS 2005), 2005. | |||
| BibTex | x | ||
| @article{ 10.1109/VIS.2005.23, author = {Jinzhu Gao and Jian Huang and C. Ryan Johnson and Scott Atchley and James Arthur Kohl}, title = {Distributed Data Management for Large Volume Visualization}, journal ={Visualization Conference, IEEE}, volume = {0}, year = {2005}, isbn = {0-7803-9462-3}, pages = {24}, doi = {http://doi.ieeecomputersociety.org/10.1109/VIS.2005.23}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Visualization Conference, IEEE TI - Distributed Data Management for Large Volume Visualization SN - 0-7803-9462-3 SP EP A1 - Jinzhu Gao, A1 - Jian Huang, A1 - C. Ryan Johnson, A1 - Scott Atchley, A1 - James Arthur Kohl, PY - 2005 KW - large data visualization KW - distributed storage KW - logistical networking KW - visibility culling KW - volume rendering KW - multiresolution rendering VL - 0 JA - Visualization Conference, IEEE ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/VIS.2005.23
We propose a distributed data management scheme for large data visualization that emphasizes efficient data sharing and access. To minimize data access time and support users with a variety of local computing capabilities, we introduce an adaptive data selection method based on an "Enhanced Time-Space Partitioning" (ETSP) tree that assists with effective visibility culling, as well as multiresolution data selection. By traversing the tree, our data management algorithm can quickly identify the visible regions of data, and, for each region, adaptively choose the lowest resolution satisfying userspecified error tolerances. Only necessary data elements are accessed and sent to the visualization pipeline. To further address the issue of sharing large-scale data among geographically distributed collaborative teams, we have designed an infrastructure for integrating our data management technique with a distributed data storage system provided by Logistical Networking (LoN). Data sets at different resolutions are generated and uploaded to LoN for wide-area access. We describe a parallel volume rendering system that verifies the effectiveness of our data storage, selection and access scheme.
Index Terms:
large data visualization, distributed storage, logistical networking, visibility culling, volume rendering, multiresolution rendering
Citation:
Jinzhu Gao, Jian Huang, C. Ryan Johnson, Scott Atchley, James Arthur Kohl, "Distributed Data Management for Large Volume Visualization," ieee_vis, pp.24, 16th IEEE Visualization 2005 (VIS 2005), 2005
Usage of this product signifies your acceptance of the Terms of Use.
