Triangulation 2D and 3D methods represent an important part of numerical modeling process (e.g. FEM). In many applications it is suitable to use triangulations with a regular structure. Moreover, decomposition with a limited number of different types of tetrahedra enables to reduce the storage and computational demands in the whole modeling process. The submitted contribution presents an overview of possible 3D decompositions using one tetrahedron (regular tilings). These decompositions are confronted with decompositions using six different types of tetrahedra (orthogonal structured tilings). Considering the shape expressivity of particular methods, the paper presents a structure of possible decompositions and comparison of storage demands ...
A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in whic...
Abstract. Two algorithms for triangulating polyhedra, which give the number of tetrahedra depending ...
A hexahedral mesh is a partition of a region in 3-space ℝ 3 into (not necessarily regular) hexahedra...
Triangulation 2D and 3D methods represent an import ant part of numerical modeling process (e.g. FE...
3D modelling and visualization based on general meshes needs a great amount of memory demands. Regul...
This thesis deals with new theoretical and practical results on convex and CSG decompositions, and t...
Neither of the two representation methods for polyhedra in use today in computer aided design system...
When solving an algorithmic problem involving a poly-hedron in R3, it is common to start by partitio...
Most 3D mesh generation techniques require simplification and mesh improvement stages to prepare a t...
Most 3D mesh generation techniques require simplication and mesh improvement stages to prepare a tet...
An algorithm for constructing almost regular triangulations (ARTs) for three-dimensional polygonal d...
Existing methods of automatic mesh generation for 3D solid objects are reviewed. Although the 3D Del...
Abstract. A completely well-centered tetrahedral mesh is a triangulation of a three dimensional doma...
We present a method for the construction of multiple levels of tetrahedral meshes approximating a tr...
In order to prepare modern finite element analysis a program for the efficient parallel generation ...
A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in whic...
Abstract. Two algorithms for triangulating polyhedra, which give the number of tetrahedra depending ...
A hexahedral mesh is a partition of a region in 3-space ℝ 3 into (not necessarily regular) hexahedra...
Triangulation 2D and 3D methods represent an import ant part of numerical modeling process (e.g. FE...
3D modelling and visualization based on general meshes needs a great amount of memory demands. Regul...
This thesis deals with new theoretical and practical results on convex and CSG decompositions, and t...
Neither of the two representation methods for polyhedra in use today in computer aided design system...
When solving an algorithmic problem involving a poly-hedron in R3, it is common to start by partitio...
Most 3D mesh generation techniques require simplification and mesh improvement stages to prepare a t...
Most 3D mesh generation techniques require simplication and mesh improvement stages to prepare a tet...
An algorithm for constructing almost regular triangulations (ARTs) for three-dimensional polygonal d...
Existing methods of automatic mesh generation for 3D solid objects are reviewed. Although the 3D Del...
Abstract. A completely well-centered tetrahedral mesh is a triangulation of a three dimensional doma...
We present a method for the construction of multiple levels of tetrahedral meshes approximating a tr...
In order to prepare modern finite element analysis a program for the efficient parallel generation ...
A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in whic...
Abstract. Two algorithms for triangulating polyhedra, which give the number of tetrahedra depending ...
A hexahedral mesh is a partition of a region in 3-space ℝ 3 into (not necessarily regular) hexahedra...