Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids

Yi-Jen Chiang

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

    Abstract

    In this paper, we propose a novel out-of-core isosurface extraction technique for large time-varying fields over irregular grids. We employ our meta-cell technique to explore the spatial coherence of the data, and our time tree algorithm to consider the temporal coherence as well. Our one-time preprocessing phase first partitions the dataset into meta-cells that cluster spatially neighboring cells together and are stored in disk. We then build a time tree to index the meta-cells for fast isosurface extraction. The time tree takes advantage of the temporal coherence among the scalar values at different time steps, and uses BBIO trees as secondary structures, which are stored in disk and support I/O-optimal interval searches. The time tree algorithm employs a novel meta-interval collapsing scheme and the buffer technique, to take care of the temporal coherence in an I/O-efficient way. We further make the time tree cache-oblivious, so that searching on it automatically performs optimal number of block transfers between any two consecutive levels of memory hierarchy (such as between cache and main memory and between main memory and disk) simultaneously. At run-time, we perform optimal cache-oblivious searches in the time tree, together with I/O-optimal searches in the BBIO trees, to read the active meta-cells from disk and generate the queried isosurface efficiently. The experiments demonstrate the effectiveness of our new technique. In particular, compared with the query-optimal main-memory algorithm [Cignoni et al. 1997] (extended for time-varying fields) when there is not enough main memory, our technique can speed up the isosurface queries from more than 18 hours to less than 4 minutes.

    Original languageEnglish (US)
    Title of host publicationProceedings of the IEEE Visualization Conference
    EditorsG. Turk, J.J. Wijk, R. Moorhead
    Pages217-224
    Number of pages8
    StatePublished - 2003
    EventVIS 2003 PROCEEDINGS - Seattle, WA, United States
    Duration: Oct 19 2003Oct 24 2003

    Other

    OtherVIS 2003 PROCEEDINGS
    CountryUnited States
    CitySeattle, WA
    Period10/19/0310/24/03

    Fingerprint

    Data storage equipment
    Experiments

    Keywords

    • Irregular grids
    • Isosurface extraction
    • Out-of-core techniques
    • Time-varying fields

    ASJC Scopus subject areas

    • Computer Science(all)
    • Engineering(all)

    Cite this

    Chiang, Y-J. (2003). Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids. In G. Turk, J. J. Wijk, & R. Moorhead (Eds.), Proceedings of the IEEE Visualization Conference (pp. 217-224)

    Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids. / Chiang, Yi-Jen.

    Proceedings of the IEEE Visualization Conference. ed. / G. Turk; J.J. Wijk; R. Moorhead. 2003. p. 217-224.

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

    Chiang, Y-J 2003, Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids. in G Turk, JJ Wijk & R Moorhead (eds), Proceedings of the IEEE Visualization Conference. pp. 217-224, VIS 2003 PROCEEDINGS, Seattle, WA, United States, 10/19/03.
    Chiang Y-J. Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids. In Turk G, Wijk JJ, Moorhead R, editors, Proceedings of the IEEE Visualization Conference. 2003. p. 217-224
    Chiang, Yi-Jen. / Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids. Proceedings of the IEEE Visualization Conference. editor / G. Turk ; J.J. Wijk ; R. Moorhead. 2003. pp. 217-224
    @inproceedings{afa48f16dfa2423ba0cdce1b1c7ca393,
    title = "Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids",
    abstract = "In this paper, we propose a novel out-of-core isosurface extraction technique for large time-varying fields over irregular grids. We employ our meta-cell technique to explore the spatial coherence of the data, and our time tree algorithm to consider the temporal coherence as well. Our one-time preprocessing phase first partitions the dataset into meta-cells that cluster spatially neighboring cells together and are stored in disk. We then build a time tree to index the meta-cells for fast isosurface extraction. The time tree takes advantage of the temporal coherence among the scalar values at different time steps, and uses BBIO trees as secondary structures, which are stored in disk and support I/O-optimal interval searches. The time tree algorithm employs a novel meta-interval collapsing scheme and the buffer technique, to take care of the temporal coherence in an I/O-efficient way. We further make the time tree cache-oblivious, so that searching on it automatically performs optimal number of block transfers between any two consecutive levels of memory hierarchy (such as between cache and main memory and between main memory and disk) simultaneously. At run-time, we perform optimal cache-oblivious searches in the time tree, together with I/O-optimal searches in the BBIO trees, to read the active meta-cells from disk and generate the queried isosurface efficiently. The experiments demonstrate the effectiveness of our new technique. In particular, compared with the query-optimal main-memory algorithm [Cignoni et al. 1997] (extended for time-varying fields) when there is not enough main memory, our technique can speed up the isosurface queries from more than 18 hours to less than 4 minutes.",
    keywords = "Irregular grids, Isosurface extraction, Out-of-core techniques, Time-varying fields",
    author = "Yi-Jen Chiang",
    year = "2003",
    language = "English (US)",
    pages = "217--224",
    editor = "G. Turk and J.J. Wijk and R. Moorhead",
    booktitle = "Proceedings of the IEEE Visualization Conference",

    }

    TY - GEN

    T1 - Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids

    AU - Chiang, Yi-Jen

    PY - 2003

    Y1 - 2003

    N2 - In this paper, we propose a novel out-of-core isosurface extraction technique for large time-varying fields over irregular grids. We employ our meta-cell technique to explore the spatial coherence of the data, and our time tree algorithm to consider the temporal coherence as well. Our one-time preprocessing phase first partitions the dataset into meta-cells that cluster spatially neighboring cells together and are stored in disk. We then build a time tree to index the meta-cells for fast isosurface extraction. The time tree takes advantage of the temporal coherence among the scalar values at different time steps, and uses BBIO trees as secondary structures, which are stored in disk and support I/O-optimal interval searches. The time tree algorithm employs a novel meta-interval collapsing scheme and the buffer technique, to take care of the temporal coherence in an I/O-efficient way. We further make the time tree cache-oblivious, so that searching on it automatically performs optimal number of block transfers between any two consecutive levels of memory hierarchy (such as between cache and main memory and between main memory and disk) simultaneously. At run-time, we perform optimal cache-oblivious searches in the time tree, together with I/O-optimal searches in the BBIO trees, to read the active meta-cells from disk and generate the queried isosurface efficiently. The experiments demonstrate the effectiveness of our new technique. In particular, compared with the query-optimal main-memory algorithm [Cignoni et al. 1997] (extended for time-varying fields) when there is not enough main memory, our technique can speed up the isosurface queries from more than 18 hours to less than 4 minutes.

    AB - In this paper, we propose a novel out-of-core isosurface extraction technique for large time-varying fields over irregular grids. We employ our meta-cell technique to explore the spatial coherence of the data, and our time tree algorithm to consider the temporal coherence as well. Our one-time preprocessing phase first partitions the dataset into meta-cells that cluster spatially neighboring cells together and are stored in disk. We then build a time tree to index the meta-cells for fast isosurface extraction. The time tree takes advantage of the temporal coherence among the scalar values at different time steps, and uses BBIO trees as secondary structures, which are stored in disk and support I/O-optimal interval searches. The time tree algorithm employs a novel meta-interval collapsing scheme and the buffer technique, to take care of the temporal coherence in an I/O-efficient way. We further make the time tree cache-oblivious, so that searching on it automatically performs optimal number of block transfers between any two consecutive levels of memory hierarchy (such as between cache and main memory and between main memory and disk) simultaneously. At run-time, we perform optimal cache-oblivious searches in the time tree, together with I/O-optimal searches in the BBIO trees, to read the active meta-cells from disk and generate the queried isosurface efficiently. The experiments demonstrate the effectiveness of our new technique. In particular, compared with the query-optimal main-memory algorithm [Cignoni et al. 1997] (extended for time-varying fields) when there is not enough main memory, our technique can speed up the isosurface queries from more than 18 hours to less than 4 minutes.

    KW - Irregular grids

    KW - Isosurface extraction

    KW - Out-of-core techniques

    KW - Time-varying fields

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

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

    M3 - Conference contribution

    AN - SCOPUS:0242424265

    SP - 217

    EP - 224

    BT - Proceedings of the IEEE Visualization Conference

    A2 - Turk, G.

    A2 - Wijk, J.J.

    A2 - Moorhead, R.

    ER -