External memory view-dependent simplification

Jihad El-Sana, Yi-Jen Chiang

    Research output: Contribution to journalArticle

    Abstract

    In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use a new spanned sub-meshes simplification technique to build view-dependence trees I/O-efficiently, which preserves the correct edge collapsing order and thus assures the run-time image quality. We further process the resulting view-dependence trees to build the meta-node trees, which can facilitate the run-time level-of-detail rendering and is kept in disk. During run-time navigation, we keep in main memory only the portions of the meta-node trees that are necessary to render the current level of details, plus some prefetched portions that are likely to be needed in the near future. The prefetching prediction takes advantage of the nature of the run-time traversal of the meta-node trees, and is both simple and accurate. We also employ the implicit dependencies for preventing incorrect foldovers, as well as main-memory buffer management and parallel processes scheme to separate the disk accesses from the navigation operations, all in an integrated manner. The experiments show that our approach scales well with respect to the main memory size available, with encouraging preprocessing and run-time rendering speeds and without sacrificing the image quality.

    Original languageEnglish (US)
    JournalComputer Graphics Forum
    Volume19
    Issue number3
    StatePublished - Aug 21 2000

    Fingerprint

    Data storage equipment
    Image quality
    Navigation
    Experiments

    ASJC Scopus subject areas

    • Computer Graphics and Computer-Aided Design
    • Software

    Cite this

    El-Sana, J., & Chiang, Y-J. (2000). External memory view-dependent simplification. Computer Graphics Forum, 19(3).

    External memory view-dependent simplification. / El-Sana, Jihad; Chiang, Yi-Jen.

    In: Computer Graphics Forum, Vol. 19, No. 3, 21.08.2000.

    Research output: Contribution to journalArticle

    El-Sana, J & Chiang, Y-J 2000, 'External memory view-dependent simplification', Computer Graphics Forum, vol. 19, no. 3.
    El-Sana, Jihad ; Chiang, Yi-Jen. / External memory view-dependent simplification. In: Computer Graphics Forum. 2000 ; Vol. 19, No. 3.
    @article{05d3e4119bbc441abdb745f83c4f5eb4,
    title = "External memory view-dependent simplification",
    abstract = "In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use a new spanned sub-meshes simplification technique to build view-dependence trees I/O-efficiently, which preserves the correct edge collapsing order and thus assures the run-time image quality. We further process the resulting view-dependence trees to build the meta-node trees, which can facilitate the run-time level-of-detail rendering and is kept in disk. During run-time navigation, we keep in main memory only the portions of the meta-node trees that are necessary to render the current level of details, plus some prefetched portions that are likely to be needed in the near future. The prefetching prediction takes advantage of the nature of the run-time traversal of the meta-node trees, and is both simple and accurate. We also employ the implicit dependencies for preventing incorrect foldovers, as well as main-memory buffer management and parallel processes scheme to separate the disk accesses from the navigation operations, all in an integrated manner. The experiments show that our approach scales well with respect to the main memory size available, with encouraging preprocessing and run-time rendering speeds and without sacrificing the image quality.",
    author = "Jihad El-Sana and Yi-Jen Chiang",
    year = "2000",
    month = "8",
    day = "21",
    language = "English (US)",
    volume = "19",
    journal = "Computer Graphics Forum",
    issn = "0167-7055",
    publisher = "Wiley-Blackwell",
    number = "3",

    }

    TY - JOUR

    T1 - External memory view-dependent simplification

    AU - El-Sana, Jihad

    AU - Chiang, Yi-Jen

    PY - 2000/8/21

    Y1 - 2000/8/21

    N2 - In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use a new spanned sub-meshes simplification technique to build view-dependence trees I/O-efficiently, which preserves the correct edge collapsing order and thus assures the run-time image quality. We further process the resulting view-dependence trees to build the meta-node trees, which can facilitate the run-time level-of-detail rendering and is kept in disk. During run-time navigation, we keep in main memory only the portions of the meta-node trees that are necessary to render the current level of details, plus some prefetched portions that are likely to be needed in the near future. The prefetching prediction takes advantage of the nature of the run-time traversal of the meta-node trees, and is both simple and accurate. We also employ the implicit dependencies for preventing incorrect foldovers, as well as main-memory buffer management and parallel processes scheme to separate the disk accesses from the navigation operations, all in an integrated manner. The experiments show that our approach scales well with respect to the main memory size available, with encouraging preprocessing and run-time rendering speeds and without sacrificing the image quality.

    AB - In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use a new spanned sub-meshes simplification technique to build view-dependence trees I/O-efficiently, which preserves the correct edge collapsing order and thus assures the run-time image quality. We further process the resulting view-dependence trees to build the meta-node trees, which can facilitate the run-time level-of-detail rendering and is kept in disk. During run-time navigation, we keep in main memory only the portions of the meta-node trees that are necessary to render the current level of details, plus some prefetched portions that are likely to be needed in the near future. The prefetching prediction takes advantage of the nature of the run-time traversal of the meta-node trees, and is both simple and accurate. We also employ the implicit dependencies for preventing incorrect foldovers, as well as main-memory buffer management and parallel processes scheme to separate the disk accesses from the navigation operations, all in an integrated manner. The experiments show that our approach scales well with respect to the main memory size available, with encouraging preprocessing and run-time rendering speeds and without sacrificing the image quality.

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

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

    M3 - Article

    VL - 19

    JO - Computer Graphics Forum

    JF - Computer Graphics Forum

    SN - 0167-7055

    IS - 3

    ER -