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

How to get this document?

Download
Commercial Copyright fee: €14.50 Basic fee: €4.00 Total price: €18.50
Academic Copyright fee: €4.50 Basic fee: €2.00 Total price: €6.50

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.

Table of contents conference proceedings

The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.

7
"Kilauea" - Parallel Global Illumination Renderer
Kato, Toshi / Saito, Jun | 2002
17
Mining the Human Genome using Virtual Reality
Stolk, Bram / Abdoelrahman, Faizal / Koning, Anton / Wielinga, Paul | 2002
23
Approach for software development of parallel real-time VE systems on heterogenous clusters
Winkelholz, C. / Alexander, T. | 2002
33
A Multi-thread Safe Foundation for Scene Graphs and its Extension to Clusters
Voß, G. / Behr, J. / Reiners, D. / Roth, M. | 2002
39
Design and Implementation of A Large-scale Hybrid Distributed Graphics System
Yang, Jian / Shi, Jiaoying / Jin, Zhefan / Zhang, Hui | 2002
51
An Interleaved Parallel Volume Renderer With PC-clusters
Antonio Garcia / Shen, Han-Wei | 2002
61
The Parallelization of the Perspective Shear-Warp Volume Rendering Algorithm
Schulze, Jürgen P. / Lang, Ulrich | 2002
71
Distributed rendering of interactive soft shadows
Isard, M. / Shand, M. / Heirich, A. | 2002
77
Interactive Ray Tracing of Time Varying Data
Reinhard, Erik / Hansen, Charles / Parker, Steve | 2002
83
Interactive Headlight Simulation - A Case Study of Interactive Distributed Ray Tracing -
Benthin, Carsten / Dahmen, Tim / Wald, Ingo / Slusallek, Philipp | 2002
89
Out-Of-Core Sort-First Parallel Rendering for Cluster-Based Tiled Displays
Correa, Wagner T. / Klosowski, James T. / Silva, Claudio T. | 2002
97
An Out-of-core Method for Computing Connectivities of Large Unstructured Meshes
Ueng, Shyh-Kuang / Sikorski, K. | 2002
105
Physical cloth simulation on a PC cluster
Zara, F. / Faure, F. / Vincent, J-M. | 2002
113
Efficient Parallel Implementations for Surface Subdivision
Padrón, E. J. / Amor, M. / Bóo, M. / Doallo, R. | 2002
123
An Efficient System for Collaboration in Tele-Immersive Environments
Jensen, N. / Olbrich, S. / Pralle, H. / Raasch, S. | 2002
133
Parallel Performance Optimization for Large-Scale Unstructured Data Visualization for the Earth Simulator
Chen, L. / Fujishiro, I. / Nakajima, K. / ACM | 2002
133
Parallel Performance Optimization of Large-Scale Unstructured Data Visualization for the Earth Simulator
Chen, L. / Fujishiro, I. / Nakajima, K. | 2002