An Out-of-core Method for Computing Connectivities of Large Unstructured Meshes
| dc.contributor.author | Ueng, Shyh-Kuang | en_US |
| dc.contributor.author | Sikorski, K. | en_US |
| dc.contributor.editor | D. Bartz and X. Pueyo and E. Reinhard | en_US |
| dc.date.accessioned | 2014-01-26T16:21:12Z | |
| dc.date.available | 2014-01-26T16:21:12Z | |
| dc.date.issued | 2002 | en_US |
| dc.description.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. | en_US |
| dc.description.seriesinformation | Eurographics Workshop on Parallel Graphics and Visualization | en_US |
| dc.identifier.isbn | 1-58113-579-3 | en_US |
| dc.identifier.issn | 1727-348X | en_US |
| dc.identifier.uri | https://doi.org/10.2312/EGPGV/EGPGV02/097-104 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | An Out-of-core Method for Computing Connectivities of Large Unstructured Meshes | en_US |
Files
Original bundle
1 - 1 of 1