3,323 research outputs found
Local refinement based on the 7-triangle longest-edge partition
The triangle longest-edge bisection constitutes an efficient scheme for refining a mesh by reducing the obtuse triangles, since the largest interior angles are subdivided. In this paper we specifically introduce a new local refinement for triangulations based on the longest-edge trisection, the 7-triangle longest-edge (7T-LE) local refinement algorithm. Each triangle to be refined is subdivided in seven sub-triangles by determining its longest edge. The conformity of the new mesh is assured by an automatic point insertion criterion using the oriented 1-skeleton graph of the triangulation and three partial division patterns
Average Interpolation Under the Maximum Angle Condition
Interpolation error estimates needed in common finite element applications
using simplicial meshes typically impose restrictions on the both the
smoothness of the interpolated functions and the shape of the simplices. While
the simplest theory can be generalized to admit less smooth functions (e.g.,
functions in H^1(\Omega) rather than H^2(\Omega)) and more general shapes
(e.g., the maximum angle condition rather than the minimum angle condition),
existing theory does not allow these extensions to be performed simultaneously.
By localizing over a well-shaped auxiliary spatial partition, error estimates
are established under minimal function smoothness and mesh regularity. This
construction is especially important in two cases: L^p(\Omega) estimates for
data in W^{1,p}(\Omega) hold for meshes without any restrictions on simplex
shape, and W^{1,p}(\Omega) estimates for data in W^{2,p}(\Omega) hold under a
generalization of the maximum angle condition which previously required p>2 for
standard Lagrange interpolation
Geometric diagram for representing shape quality in mesh refinement
summary:We review and discuss a method to normalize triangles by the longest-edge. A geometric diagram is described as a helpful tool for studying and interpreting the quality of triangle shapes during iterative mesh refinements. Modern CAE systems as those implementing the finite element method (FEM) require such tools for guiding the user about the quality of generated triangulations. In this paper we show that a similar method and corresponding geometric diagram in the three-dimensional case do not exist
Hamiltonian triangular refinements and space-filling curves
We have introduced here the concept of Hamiltonian triangular refinement. For any
Hamiltonian triangulation it is shown that there is a refinement which is also a Hamiltonian
triangulation and the corresponding Hamiltonian path preserves the nesting condition of
the corresponding space-filling curve. We have proved that the number of such Hamiltonian
triangular refinements is bounded from below and from above. The relation between
Hamiltonian triangular refinements and space-filling curves is also explored and explained
eXtended Variational Quasicontinuum Methodology for Lattice Networks with Damage and Crack Propagation
Lattice networks with dissipative interactions are often employed to analyze
materials with discrete micro- or meso-structures, or for a description of
heterogeneous materials which can be modelled discretely. They are, however,
computationally prohibitive for engineering-scale applications. The
(variational) QuasiContinuum (QC) method is a concurrent multiscale approach
that reduces their computational cost by fully resolving the (dissipative)
lattice network in small regions of interest while coarsening elsewhere. When
applied to damageable lattices, moving crack tips can be captured by adaptive
mesh refinement schemes, whereas fully-resolved trails in crack wakes can be
removed by mesh coarsening. In order to address crack propagation efficiently
and accurately, we develop in this contribution the necessary generalizations
of the variational QC methodology. First, a suitable definition of crack paths
in discrete systems is introduced, which allows for their geometrical
representation in terms of the signed distance function. Second, special
function enrichments based on the partition of unity concept are adopted, in
order to capture kinematics in the wakes of crack tips. Third, a summation rule
that reflects the adopted enrichment functions with sufficient degree of
accuracy is developed. Finally, as our standpoint is variational, we discuss
implications of the mesh refinement and coarsening from an energy-consistency
point of view. All theoretical considerations are demonstrated using two
numerical examples for which the resulting reaction forces, energy evolutions,
and crack paths are compared to those of the direct numerical simulations.Comment: 36 pages, 23 figures, 1 table, 2 algorithms; small changes after
review, paper title change
RTIN-based strategies for local mesh refinement
summary:Longest-edge bisection algorithms are often used for local mesh refinements within the finite element method in 2D. In this paper, we discuss and describe their conforming variant. A particular attention is devoted to the so-called Right-Triangulated Irregular Network (RTIN) based on isosceles right triangles and its tranformation to more general domains. We suggest to combine RTIN with a balanced quadrant tree (QuadTree) decomposition. This combination does not produce hanging nodes within the mesh refinements and could be extended to tetrahedral meshes in 3D
Interpolation and scattered data fitting on manifolds using projected Powell–Sabin splines
We present methods for either interpolating data or for fitting scattered data on a two-dimensional smooth manifold. The methods are based on a local bivariate Powell-Sabin interpolation scheme, and make use of a family of charts {(Uξ , ξ)}ξ∈ satisfying certain conditions of smooth dependence on ξ. If is a C2-manifold embedded into R3, then projections into tangent planes can be employed. The data fitting method is a two-stage method. We prove that the resulting function on the manifold is continuously differentiable, and establish error bounds for both methods for the case when the data are generated by a smooth function
- …