Out-of-core volume rendering for time-varying fields using a space-partitioning time (SPT) tree

Zhiyan Du, Yi-Jen Chiang, Han Wei Shen

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    In this paper, we propose a novel out-of-core volume rendering algorithm for large time-varying fields. Exploring temporal and spatial coherences has been an important direction for speeding up the rendering of time-varying data. Previously, there were techniques that hierarchically partition both the time and space domains into a data structure so as to re-use some results from the previous time step in multiresolution rendering; however, it has not been studied on which domain should be partitioned first to obtain a better re-use rate. We address this open question, and show both theoretically and experimentally that partitioning the time domain first is better. We call the resulting structure (a binary time tree as the primary structure and an octree as the secondary structure) the spacepartitioning time (SPT) tree. Typically, our SPT-tree rendering has a higher level of details, a higher re-use rate, and runs faster. In addition, we devise a novel cut-finding algorithm to facilitate effi-cient out-of-core volume rendering using our SPT tree, we develop a novel out-of-core preprocessing algorithm to build our SPT tree I/O-efficiently, and we propose modified error metrics with a theoretical guarantee of a monotonicity property that is desirable for the tree search. The experiments on datasets as large as 25GB using a PC with only 2GB of RAM demonstrated the efficacy of our new approach.

    Original languageEnglish (US)
    Title of host publicationIEEE Pacific Visualization Symposium, PacificVis 2009 - Proceedings
    Pages73-80
    Number of pages8
    DOIs
    StatePublished - 2009
    EventIEEE Pacific Visualization Symposium, PacificVis 2009 - Beijing, China
    Duration: Apr 20 2009Apr 23 2009

    Other

    OtherIEEE Pacific Visualization Symposium, PacificVis 2009
    CountryChina
    CityBeijing
    Period4/20/094/23/09

    Fingerprint

    Volume rendering
    Random access storage
    Data structures
    Experiments

    ASJC Scopus subject areas

    • Computer Graphics and Computer-Aided Design
    • Computer Vision and Pattern Recognition
    • Software

    Cite this

    Du, Z., Chiang, Y-J., & Shen, H. W. (2009). Out-of-core volume rendering for time-varying fields using a space-partitioning time (SPT) tree. In IEEE Pacific Visualization Symposium, PacificVis 2009 - Proceedings (pp. 73-80). [4906840] https://doi.org/10.1109/PACIFICVIS.2009.4906840

    Out-of-core volume rendering for time-varying fields using a space-partitioning time (SPT) tree. / Du, Zhiyan; Chiang, Yi-Jen; Shen, Han Wei.

    IEEE Pacific Visualization Symposium, PacificVis 2009 - Proceedings. 2009. p. 73-80 4906840.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Du, Z, Chiang, Y-J & Shen, HW 2009, Out-of-core volume rendering for time-varying fields using a space-partitioning time (SPT) tree. in IEEE Pacific Visualization Symposium, PacificVis 2009 - Proceedings., 4906840, pp. 73-80, IEEE Pacific Visualization Symposium, PacificVis 2009, Beijing, China, 4/20/09. https://doi.org/10.1109/PACIFICVIS.2009.4906840
    Du Z, Chiang Y-J, Shen HW. Out-of-core volume rendering for time-varying fields using a space-partitioning time (SPT) tree. In IEEE Pacific Visualization Symposium, PacificVis 2009 - Proceedings. 2009. p. 73-80. 4906840 https://doi.org/10.1109/PACIFICVIS.2009.4906840
    Du, Zhiyan ; Chiang, Yi-Jen ; Shen, Han Wei. / Out-of-core volume rendering for time-varying fields using a space-partitioning time (SPT) tree. IEEE Pacific Visualization Symposium, PacificVis 2009 - Proceedings. 2009. pp. 73-80
    @inproceedings{07cffb43dda142d99ae2ef4337d99714,
    title = "Out-of-core volume rendering for time-varying fields using a space-partitioning time (SPT) tree",
    abstract = "In this paper, we propose a novel out-of-core volume rendering algorithm for large time-varying fields. Exploring temporal and spatial coherences has been an important direction for speeding up the rendering of time-varying data. Previously, there were techniques that hierarchically partition both the time and space domains into a data structure so as to re-use some results from the previous time step in multiresolution rendering; however, it has not been studied on which domain should be partitioned first to obtain a better re-use rate. We address this open question, and show both theoretically and experimentally that partitioning the time domain first is better. We call the resulting structure (a binary time tree as the primary structure and an octree as the secondary structure) the spacepartitioning time (SPT) tree. Typically, our SPT-tree rendering has a higher level of details, a higher re-use rate, and runs faster. In addition, we devise a novel cut-finding algorithm to facilitate effi-cient out-of-core volume rendering using our SPT tree, we develop a novel out-of-core preprocessing algorithm to build our SPT tree I/O-efficiently, and we propose modified error metrics with a theoretical guarantee of a monotonicity property that is desirable for the tree search. The experiments on datasets as large as 25GB using a PC with only 2GB of RAM demonstrated the efficacy of our new approach.",
    author = "Zhiyan Du and Yi-Jen Chiang and Shen, {Han Wei}",
    year = "2009",
    doi = "10.1109/PACIFICVIS.2009.4906840",
    language = "English (US)",
    isbn = "9781424444045",
    pages = "73--80",
    booktitle = "IEEE Pacific Visualization Symposium, PacificVis 2009 - Proceedings",

    }

    TY - GEN

    T1 - Out-of-core volume rendering for time-varying fields using a space-partitioning time (SPT) tree

    AU - Du, Zhiyan

    AU - Chiang, Yi-Jen

    AU - Shen, Han Wei

    PY - 2009

    Y1 - 2009

    N2 - In this paper, we propose a novel out-of-core volume rendering algorithm for large time-varying fields. Exploring temporal and spatial coherences has been an important direction for speeding up the rendering of time-varying data. Previously, there were techniques that hierarchically partition both the time and space domains into a data structure so as to re-use some results from the previous time step in multiresolution rendering; however, it has not been studied on which domain should be partitioned first to obtain a better re-use rate. We address this open question, and show both theoretically and experimentally that partitioning the time domain first is better. We call the resulting structure (a binary time tree as the primary structure and an octree as the secondary structure) the spacepartitioning time (SPT) tree. Typically, our SPT-tree rendering has a higher level of details, a higher re-use rate, and runs faster. In addition, we devise a novel cut-finding algorithm to facilitate effi-cient out-of-core volume rendering using our SPT tree, we develop a novel out-of-core preprocessing algorithm to build our SPT tree I/O-efficiently, and we propose modified error metrics with a theoretical guarantee of a monotonicity property that is desirable for the tree search. The experiments on datasets as large as 25GB using a PC with only 2GB of RAM demonstrated the efficacy of our new approach.

    AB - In this paper, we propose a novel out-of-core volume rendering algorithm for large time-varying fields. Exploring temporal and spatial coherences has been an important direction for speeding up the rendering of time-varying data. Previously, there were techniques that hierarchically partition both the time and space domains into a data structure so as to re-use some results from the previous time step in multiresolution rendering; however, it has not been studied on which domain should be partitioned first to obtain a better re-use rate. We address this open question, and show both theoretically and experimentally that partitioning the time domain first is better. We call the resulting structure (a binary time tree as the primary structure and an octree as the secondary structure) the spacepartitioning time (SPT) tree. Typically, our SPT-tree rendering has a higher level of details, a higher re-use rate, and runs faster. In addition, we devise a novel cut-finding algorithm to facilitate effi-cient out-of-core volume rendering using our SPT tree, we develop a novel out-of-core preprocessing algorithm to build our SPT tree I/O-efficiently, and we propose modified error metrics with a theoretical guarantee of a monotonicity property that is desirable for the tree search. The experiments on datasets as large as 25GB using a PC with only 2GB of RAM demonstrated the efficacy of our new approach.

    UR - http://www.scopus.com/inward/record.url?scp=67650532648&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=67650532648&partnerID=8YFLogxK

    U2 - 10.1109/PACIFICVIS.2009.4906840

    DO - 10.1109/PACIFICVIS.2009.4906840

    M3 - Conference contribution

    AN - SCOPUS:67650532648

    SN - 9781424444045

    SP - 73

    EP - 80

    BT - IEEE Pacific Visualization Symposium, PacificVis 2009 - Proceedings

    ER -