Journal Article10.1007/BF01782476
A note on a linear time algorithm for constructing adjacency graphs of 3D FEA data
Shyh-Kuang Ueng,K. Sikorski +1 more
9
TL;DR: This paper developed an efficient algorithm for constructing adjacency graphs of 3D finite element analysis (FEA) data by establishing intermediate data structures and using bin-sorting, which is linear in the number of data cells.
read more
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, eg, 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
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
SOT: Compact Representation for Triangle and Tetrahedral Meshes
Jarek Rossignac,Topraj Gurung +1 more
- 01 Jan 2010
TL;DR: The Sorted Opposite Table (SOT) variation is proposed, which eliminates the Vertex table completely and hence reduces storage requirements by 50% to only 3 references per triangle for triangle meshes and 4 references and 9 bits per tetrahedron for tetrahedral meshes, while preserving the vertex-to-incidentcorner references.
An out-of-core method for computing connectivities of large unstructured meshes
Shyh-Kuang Ueng,K. Sikorski +1 more
- 09 Sep 2002
TL;DR: An out-of-core method is presented for finding connectivities of large unstructured FEA data sets by combining edge files into a single file by using external merge sort and the connectivity information is computed.
5
Out-of-core encoding of large tetrahedral meshes
Shyh-Kuang Ueng
- 07 Jul 2003
TL;DR: Test results reveal that the out-of-core compression method can compress large meshes on a desk-top machine with moderate memory space within reasonable time and achieves better compression ratios than an incore method which was developed in a previous research.
4
LoD Volume Rendering of FEA Data
Shyh-Kuang Ueng,Yan-Jen Su,Chi-Tang Chang +2 more
- 10 Oct 2004
TL;DR: A new multiple resolution volume rendering method for finite element analysis (FEA) data is presented, composed of three stages: in the first stage, the Gauss points of the FEA cells are calculated, and a hierarchical structure is established upon the adjacency graph.
1
Visualization Toolkit and its application
Sun Lihua,Wu Yunzhi +1 more
- 26 Jun 2010
TL;DR: Some basic concept of VTK is described, including dataset, pipeline, and common algorithm, and some applications in medical imaging, computational fluid dynamics, finite element analysis and modeling are given.
References
A polygonal approximation to direct scalar volume rendering
Peter Shirley,Allan Tuchman +1 more
- 01 Nov 1990
TL;DR: A method is presented that approximates tetrahedral volume cells with hardware renderable transparent triangles that produces results which are visually similar to more exact methods for scalar volume rendering, but is faster and has smaller memory requirements.
515
Area and volume coherence for efficient visualization of 3D scalar functions
Nelson Max,Pat Hanrahan,Roger Crawfis +2 more
- 01 Nov 1990
TL;DR: An algorithm for compositing a combination of density clouds and contour surfaces used to represent a scalar function on a 3-D volume subdivided into convex polyhedra, which provides a method for visualizing such data sets.
A polygonal approximation to direct scalar volume rendering
ShirleyPeter,TuchmanAllan +1 more
TL;DR: One method of directly rendering a three-dimensional volume of scalar data is to project each cell in a volume onto the screen as mentioned in this paper, which is more complex than rasterizing a polygon.
227
Visibility-ordering meshed polyhedra
TL;DR: It is shown how the ordering algorithms used for domain decomposition of finite element meshes for parallel processing, and how the data structures used by these algorithms can be used to solve the spatial point location problem.
226
Area and volume coherence for efficient visualization of 3D scalar functions
TL;DR: In this paper, a combination of density clouds and contour surfaces is used to represent a scalar function on a 3D volume subdivided into convex polyhedra, and the scalar functio...
139