Loading...
Projects / Programmes source: ARIS

Compression of elements appearing in the final elements methods (FEM)

Research activity

Code Science Field Subfield
2.12.00  Engineering sciences and technologies  Electric devices   

Code Science Field
T190  Technological sciences  Electrical engineering 
Keywords
algorithms, topology, data compression, FEM, CAD, computational geometry
Evaluation (rules)
source: COBISS
Researchers (2)
no. Code Name and surname Research area Role Period No. of publicationsNo. of publications
1.  21317  PhD Sebastian Krivograd  Computer science and informatics  Researcher  2004 - 2006  81 
2.  02077  PhD Mladen Trlep  Electric devices  Head  2004 - 2006  515 
Organisations (1)
no. Code Research organisation City Registration number No. of publicationsNo. of publications
1.  0796  University of Maribor, Faculty of Electrical Engineering and Computer Science  Maribor  5089638003  27,539 
Abstract
The main goal of the project is development of the method for compression of geometric meshes consisting of triangles and rectangles in 2D and tetrahedrons and blocks in 3D space with application in the final elements methods (FEM). These meshes employed for solving partial and differential equations can consist of some 100.000 vertices forming various elements. We can meet serious problems in storing these large geometric meshes, and their transmission in Internet is practically dissabled. For example, a FEM triangular mesh with 1.000.000 vertices requires 22 MB of storage without compression (on the average, each vertex in the triangular mesh is repeated 6 times, and it is described by 3 coordinates requiring 3 x 32 bits each).For this reason, the main goal of this research project is to gain new knowledges enabling us efficient compression of topology of final elements, and to use these knowledges for development of an original method, because we have not found any method in the literature, able to efficiently compress various types of geometric elements appearing in the same mesh. First, all existing methods compressing particular types of elements (triangles, trapesoids, tetrahedrons, polygons, hexahedrons etc.) will be examined and analysed, and their advantages and disadvantages will be found. After this, we will define all possible states and commands for solving them. An intended original method should keep all advantages of the existing methods, but all their drawbacks should be omitted. All the methods, the existing ones, and the intended original one, will be tested by using both, artificial and real-world examples, either created by ourselves or obtained in the Internet. The final result of the whole research will be the new method for efficient compression of topologies of various elements employed in FEM. The method will be implemented in CPLUS PLUS.
Views history
Favourite