Abstract
In this paper, we present an algorithm for constructing adjacency graphs of 3D finite element analysis (FEA) data. Adjacency graphs are created to represent the connectivities of FEA data cells. They are used in most visualization methods for FEA data. We stress that in many engineering applications FEA data sets do not contain the adjacency information. This is opposite to computer-aided geometric design where, e.g., the winged edge geometrical representation is usually generated and utilized. By establishing intermediate data structures and using bin-sorting, we developed an efficient algorithm for constructing such graphs. The total time complexity of the algorithm is linear in the number of data cells.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Crawfis R, Max N (1992) Direct volume visualization of three-dimensional vector fields. In:Proceedings of the 1992 Workshop on Volume Visualization ACM SIGGRAPH New York:55–60
Garrity MP (1990) Raytracing irregular volume data. Comput graph 24:35–40
Giertsen C (1992) Volume visualization of sparse irregular meshes. IEEE Comput Graph Appl 12:40–48
Horowitz E, Sahni S (1984) Fundamentals of data structures in Pascal. Computer Science Press, Rockville, MD
Koyamada K (1991) Nishio T. Volume visualization of 3D finite element method results. IBM J Res Dev 35:12–25
Lohner R (1990) A vectorized particle tracer for unstructured grids. J Comput Phys 91:22–31
Max N, Hanrahan P, Crawfis R (1990) Area and volume coherence for efficient visualization of 3D scalar functions. Comput Graph 24:5 27–33
Murman E, Powell K (1988) Trajectory integration in vortical flows. AIAA 27:982–984
Shirley P, Tuchman A (1990) A polygon approximation to direct scalar volume rendering. Comput Graph 24:63–70
Ueng S-K, Sikorski K (1995) Parallel visualization of 3D FEA data. In:Proceedings of the 7th SIAM Conference on Parallel Processing for Scientific Computing, San Francisco: 808–813
Ueng S-K, Sikorski K, Ma K-L (1995) Fast algorithms for visualizing fluid motion in steady flow on unstructured grids. In: Proceedings of Visualization '95 IEEE Computer Society Press, Los Alamitos, California: 313–319
Williams PL (1992) Interactive splatting of nonrectilinear volumes. In: Proceedings of Visualization '92 IEEE Computer Society Press, Los Alamitos, California, 37–44
Williams PL (1992) Visibility ordering meshed polyhedra. ACM Trans Graph 11:103–126
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ueng, S.K., Sikorski, K. A note on a linear time algorithm for constructing adjacency graphs of 3D FEA data. The Visual Computer 12, 445–450 (1996). https://doi.org/10.1007/BF01782476
Issue Date:
DOI: https://doi.org/10.1007/BF01782476