• Login
    View Item 
    •   Eurographics DL Home
    • Eurographics Workshops and Symposia
    • EGPGV: Eurographics Workshop on Parallel Graphics and Visualization
    • EGPGV02: Eurographics Workshop on Parallel Graphics and Visualization
    • View Item
    •   Eurographics DL Home
    • Eurographics Workshops and Symposia
    • EGPGV: Eurographics Workshop on Parallel Graphics and Visualization
    • EGPGV02: Eurographics Workshop on Parallel Graphics and Visualization
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    An Out-of-core Method for Computing Connectivities of Large Unstructured Meshes

    Thumbnail
    View/Open
    097-104.pdf (137.3Kb)
    Date
    2002
    Author
    Ueng, Shyh-Kuang
    Sikorski, K.
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    Abstract
    Adjacency graphs of meshes are important for visualizing or compressing unstructured scientific data. However, calculating adjacency graphs requires intensive memory space. For large data sets, the calculation becomes very inefficient on desk-top computers with limited main memory. In this article, an out-of-core method is presented for finding connectivities of large unstructured FEA data sets. Our algorithm composes of three stages. At the first stage, FEA cells are read into main memory in blocks. For each cell block read, cell faces are generated and distributed into disjoint groups. These groups are small enough such that each group can reside in main memory without causing any page swapping. The resulted groups are stored in disk files. At the second stage, the face groups are fetched into main memory and processed there one after another. Adjacency graph edges are determined in each face group by sorting faces and examining consecutive faces. The edges contained in a group are kept in a disk file. At the third stage, edge files are merged into a single file by using external merge sort, and the connectivity information is computed.
    BibTeX
    @inproceedings {EGPGV:EGPGV02:097-104,
    booktitle = {Eurographics Workshop on Parallel Graphics and Visualization},
    editor = {D. Bartz and X. Pueyo and E. Reinhard},
    title = {{An Out-of-core Method for Computing Connectivities of Large Unstructured Meshes}},
    author = {Ueng, Shyh-Kuang and Sikorski, K.},
    year = {2002},
    publisher = {The Eurographics Association},
    ISSN = {1727-348X},
    ISBN = {1-58113-579-3},
    DOI = {10.2312/EGPGV/EGPGV02/097-104}
    }
    URI
    http://dx.doi.org/10.2312/EGPGV/EGPGV02/097-104
    Collections
    • EGPGV02: Eurographics Workshop on Parallel Graphics and Visualization

    Eurographics Association copyright © 2013 - 2020 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2020 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA