A finite element framework for modeling internal frictional contact in three-dimensional fractured media using unstructured tetrahedral meshes

AbstractThis paper introduces a three-dimensional finite element (FE) formulation to accurately model the linear elastic deformation of fractured media under compressive loading. The presented method applies the classic Augmented Lagrangian(AL)-Uzawa method, to evaluate the growth of multiple interacting and intersecting discrete fractures. The volume and surfaces are discretized by unstructured quadratic triangle-tetrahedral meshes; quarter-point triangles and tetrahedra are placed around fracture tips. Frictional contact between crack faces for high contact precisions is modeled using isoparametric integration point-to-integration point contact discretization, and a gap-based augmentation procedure. Contact forces are updated by interpolating tractions over elements that are adjacent to fracture tips, and have boundaries that are excluded from the contact region. Stress intensity factors are computed numerically using the methods of displacement correlation and disk-shaped domain integral. A novel square-root singular variation of the penalty parameter near the crack front is proposed to accurately model the contact tractions near the crack front. Tractions and compressive stress intensity factors are validated against analytical solutions. Numerical examples of cubes containing one, two, twenty four and seventy interacting and intersecting fractures are presented

Multi-Resolution Texture Coding for Multi-Resolution 3D Meshes

We present an innovative system to encode and transmit textured multi-resolution 3D meshes in a progressive way, with no need to send several texture images, one for each mesh LOD (Level Of Detail). All texture LODs are created from the finest one (associated to the finest mesh), but can be re- constructed progressively from the coarsest thanks to refinement images calculated in the encoding process, and transmitted only if needed. This allows us to adjust the LOD/quality of both 3D mesh and texture according to the rendering power of the device that will display them, and to the network capacity. Additionally, we achieve big savings in data transmission by avoiding altogether texture coordinates, which are generated automatically thanks to an unwrapping system agreed upon by both encoder and decoder

Arbitrary-Lagrangian-Eulerian One-Step WENO Finite Volume Schemes on Unstructured Triangular Meshes

In this article we present a new class of high order accurate Arbitrary-Eulerian-Lagrangian (ALE) one-step WENO finite volume schemes for solving nonlinear hyperbolic systems of conservation laws on moving two dimensional unstructured triangular meshes. A WENO reconstruction algorithm is used to achieve high order accuracy in space and a high order one-step time discretization is achieved by using the local space-time Galerkin predictor. For that purpose, a new element--local weak formulation of the governing PDE is adopted on moving space--time elements. The space-time basis and test functions are obtained considering Lagrange interpolation polynomials passing through a predefined set of nodes. Moreover, a polynomial mapping defined by the same local space-time basis functions as the weak solution of the PDE is used to map the moving physical space-time element onto a space-time reference element. To maintain algorithmic simplicity, the final ALE one-step finite volume scheme uses moving triangular meshes with straight edges. This is possible in the ALE framework, which allows a local mesh velocity that is different from the local fluid velocity. We present numerical convergence rates for the schemes presented in this paper up to sixth order of accuracy in space and time and show some classical numerical test problems for the two-dimensional Euler equations of compressible gas dynamics.Comment: Accepted by "Communications in Computational Physics

3D Point Cloud Data and Triangle Face Compression by a Novel Geometry Minimization Algorithm and Comparison with other 3D Formats

Polygonal meshes remain the primary representation for visualization of 3D data in a wide range of industries including manufacturing, architecture, geographic information systems, medical imaging, robotics, entertainment, and military applications. Because of its widespread use, it is desirable to compress polygonal meshes stored in file servers and exchanged over computer networks to reduce storage and transmission time requirements. 3D files encoded by OBJ format are commonly used to share models due to its clear simple design. Normally each OBJ file contains a large amount of data (e.g. vertices and triangulated faces) describing the mesh surface. In this research we introduce a novel algorithm to compress vertices and triangle faces called Geometry Minimization Algorithm (GM-Algorithm). First, each vertex consists of (x, y, z) coordinates that are encoded into a single value by the GM-Algorithm. Second, triangle faces are encoded by computing the differences between two adjacent vertex locations, and then coded by the GM-Algorithm followed by arithmetic coding. We tested the method on large data sets achieving high compression ratios over 90% while keeping the same number of vertices and triangle faces as the original mesh. The decompression step is based on a Parallel Fast Matching Search Algorithm (Parallel-FMS) to recover the structure of the 3D mesh. A comparative analysis of compression ratios is provided with a number of commonly used 3D file formats such as MATLAB, VRML, OpenCTM and STL showing the advantages and effectiveness of our approach

High Order Cell-Centered Lagrangian-Type Finite Volume Schemes with Time-Accurate Local Time Stepping on Unstructured Triangular Meshes

We present a novel cell-centered direct Arbitrary-Lagrangian-Eulerian (ALE) finite volume scheme on unstructured triangular meshes that is high order accurate in space and time and that also allows for time-accurate local time stepping (LTS). The new scheme uses the following basic ingredients: a high order WENO reconstruction in space on unstructured meshes, an element-local high-order accurate space-time Galerkin predictor that performs the time evolution of the reconstructed polynomials within each element, the computation of numerical ALE fluxes at the moving element interfaces through approximate Riemann solvers, and a one-step finite volume scheme for the time update which is directly based on the integral form of the conservation equations in space-time. The inclusion of the LTS algorithm requires a number of crucial extensions, such as a proper scheduling criterion for the time update of each element and for each node; a virtual projection of the elements contained in the reconstruction stencils of the element that has to perform the WENO reconstruction; and the proper computation of the fluxes through the space-time boundary surfaces that will inevitably contain hanging nodes in time due to the LTS algorithm. We have validated our new unstructured Lagrangian LTS approach over a wide sample of test cases solving the Euler equations of compressible gasdynamics in two space dimensions, including shock tube problems, cylindrical explosion problems, as well as specific tests typically adopted in Lagrangian calculations, such as the Kidder and the Saltzman problem. When compared to the traditional global time stepping (GTS) method, the newly proposed LTS algorithm allows to reduce the number of element updates in a given simulation by a factor that may depend on the complexity of the dynamics, but which can be as large as 4.7.Comment: 31 pages, 13 figure

Mesh compression: Theory and practice.

Three-dimensional meshes (3D meshes, for short) are fast becoming an emerging media type, used in a variety of application domains such as engineering design, manufacture, architecture, bio-informatics, medicine, entertainment, commerce, science, defense, etc. The volume of data of this media type that is being circulated on the internet is increasing very rapidly and is being used as frequently as other media types like text, audio (1D), images and video (2D). Hence, 3D meshes need good processing and visualization methods. Also, the sizes of these meshes are much greater than the other media types mentioned above and often exceeds the memory and bandwidth available for their storage and transmission. Compression schemes for such large 3D meshes have become a subject of intense study lately. Meshes are either made up of triangles or quadrilaterals. Meshes made up of only triangles are called triangle meshes and meshes made up of quadrilaterals are called quadrilateral meshes (quad meshes, for short). A mesh is described by specifying its geometry (vertex coordinates) and its connectivity (adjacencies of the triangles or quadrilaterals). Previous research on mesh compression has been mostly for triangle meshes. Quad meshes were traditionally handled by first triangulating them and then applying triangle mesh compression techniques. In order to avoid this additional triangulation step, a direct technique is proposed for compressing and decompressing the connectivity of quad meshes. This technique takes a quad mesh as input and encodes its connectivity as a sequence of opcodes which can be restored back to the quad mesh, using the decompression technique. A data structure called EdgeTable is introduced to aid in the traversal of a quad mesh during compression. Also, a technique based on constrained Delaunay triangulation for reconstructing the connectivity of a 2D mesh from its geometry and a minimum set of edges is proposed. Source: Masters Abstracts International, Volume: 44-03, page: 1393. Thesis (M.Sc.)--University of Windsor (Canada), 2005