56 resultados para Triangular meshes
Resumo:
Generating quadrilateral meshes is a highly non-trivial task, as design decisions are frequently driven by specific application demands. Automatic techniques can optimize objective quality metrics, such as mesh regularity, orthogonality, alignment and adaptivity; however, they cannot make subjective design decisions. There are a few quad meshing approaches that offer some mechanisms to include the user in the mesh generation process; however, these techniques either require a large amount of user interaction or do not provide necessary or easy to use inputs. Here, we propose a template-based approach for generating quad-only meshes from triangle surfaces. Our approach offers a flexible mechanism to allow external input, through the definition of alignment features that are respected during the mesh generation process. While allowing user inputs to support subjective design decisions, our approach also takes into account objective quality metrics to produce semi-regular, quad-only meshes that align well to desired surface features. Published by Elsevier Ltd.
Resumo:
This paper describes a novel template-based meshing approach for generating good quality quadrilateral meshes from 2D digital images. This approach builds upon an existing image-based mesh generation technique called Imeshp, which enables us to create a segmented triangle mesh from an image without the need for an image segmentation step. Our approach generates a quadrilateral mesh using an indirect scheme, which converts the segmented triangle mesh created by the initial steps of the Imesh technique into a quadrilateral one. The triangle-to-quadrilateral conversion makes use of template meshes of triangles. To ensure good element quality, the conversion step is followed by a smoothing step, which is based on a new optimization-based procedure. We show several examples of meshes generated by our approach, and present a thorough experimental evaluation of the quality of the meshes given as examples.
Resumo:
In this work we introduce a new hierarchical surface decomposition method for multiscale analysis of surface meshes. In contrast to other multiresolution methods, our approach relies on spectral properties of the surface to build a binary hierarchical decomposition. Namely, we utilize the first nontrivial eigenfunction of the Laplace-Beltrami operator to recursively decompose the surface. For this reason we coin our surface decomposition the Fiedler tree. Using the Fiedler tree ensures a number of attractive properties, including: mesh-independent decomposition, well-formed and nearly equi-areal surface patches, and noise robustness. We show how the evenly distributed patches can be exploited for generating multiresolution high quality uniform meshes. Additionally, our decomposition permits a natural means for carrying out wavelet methods, resulting in an intuitive method for producing feature-sensitive meshes at multiple scales. Published by Elsevier Ltd.
Resumo:
We propose a discontinuous-Galerkin-based immersed boundary method for elasticity problems. The resulting numerical scheme does not require boundary fitting meshes and avoids boundary locking by switching the elements intersected by the boundary to a discontinuous Galerkin approximation. Special emphasis is placed on the construction of a method that retains an optimal convergence rate in the presence of non-homogeneous essential and natural boundary conditions. The role of each one of the approximations introduced is illustrated by analyzing an analog problem in one spatial dimension. Finally, extensive two- and three-dimensional numerical experiments on linear and nonlinear elasticity problems verify that the proposed method leads to optimal convergence rates under combinations of essential and natural boundary conditions. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
A numerical method to approximate partial differential equations on meshes that do not conform to the domain boundaries is introduced. The proposed method is conceptually simple and free of user-defined parameters. Starting with a conforming finite element mesh, the key ingredient is to switch those elements intersected by the Dirichlet boundary to a discontinuous-Galerkin approximation and impose the Dirichlet boundary conditions strongly. By virtue of relaxing the continuity constraint at those elements. boundary locking is avoided and optimal-order convergence is achieved. This is shown through numerical experiments in reaction-diffusion problems. Copyright (c) 2008 John Wiley & Sons, Ltd.
Resumo:
Purpose - The purpose of this paper is to develop a novel unstructured simulation approach for injection molding processes described by the Hele-Shaw model. Design/methodology/approach - The scheme involves dual dynamic meshes with active and inactive cells determined from an initial background pointset. The quasi-static pressure solution in each timestep for this evolving unstructured mesh system is approximated using a control volume finite element method formulation coupled to a corresponding modified volume of fluid method. The flow is considered to be isothermal and non-Newtonian. Findings - Supporting numerical tests and performance studies for polystyrene described by Carreau, Cross, Ellis and Power-law fluid models are conducted. Results for the present method are shown to be comparable to those from other methods for both Newtonian fluid and polystyrene fluid injected in different mold geometries. Research limitations/implications - With respect to the methodology, the background pointset infers a mesh that is dynamically reconstructed here, and there are a number of efficiency issues and improvements that would be relevant to industrial applications. For instance, one can use the pointset to construct special bases and invoke a so-called ""meshless"" scheme using the basis. This would require some interesting strategies to deal with the dynamic point enrichment of the moving front that could benefit from the present front treatment strategy. There are also issues related to mass conservation and fill-time errors that might be addressed by introducing suitable projections. The general question of ""rate of convergence"" of these schemes requires analysis. Numerical results here suggest first-order accuracy and are consistent with the approximations made, but theoretical results are not available yet for these methods. Originality/value - This novel unstructured simulation approach involves dual meshes with active and inactive cells determined from an initial background pointset: local active dual patches are constructed ""on-the-fly"" for each ""active point"" to form a dynamic virtual mesh of active elements that evolves with the moving interface.
Resumo:
We introduce a Sherrington-Kirkpatrick spin-glass model with the addition of elastic degrees of freedom. The problem is formulated in terms of an effective four-spin Hamiltonian in the pressure ensemble, which can be treated by the replica method. In the replica-symmetric approximation, we analyze the pressure-temperature phase diagram, and obtain expressions for the critical boundaries between the disordered and the ordered (spin-glass and ferromagnetic) phases. The second-order para-ferromagnetic border ends at a tricritical point, beyond which the transition becomes discontinuous. We use these results to make contact with the temperature-concentration phase diagrams of mixtures of hydrogen-bonded crystals.
Resumo:
(i) The electronic and structural properties of boron doped graphene sheets, and (ii) the chemisorption processes of hydrogen adatoms on the boron doped graphene sheets have been examined by ab initio total energy calculations. In (i) we find that the structural deformations are very localized around the boron substitutional sites, and in accordance with previous studies (Endo et al 2001 J. Appl. Phys. 90 5670) there is an increase of the electronic density of states near the Fermi level. Our simulated scanning tunneling microscope (STM) images, for occupied states, indicate the formation of bright (triangular) spots lying on the substitutional boron (center) and nearest-neighbor carbon (edge) sites. Those STM images are attributed to the increase of the density of states within an energy interval of 0.5 eV below the Fermi level. For a boron concentration of similar to 2.4%, we find that two boron atoms lying on the opposite sites of the same hexagonal ring (B1-B2 configuration) represents the energetically most stable configuration, which is in contrast with previous theoretical findings. Having determined the energetically most stable configuration for substitutional boron atoms on graphene sheets, we next considered the hydrogen adsorption process as a function of the boron concentration, (ii). Our calculated binding energies indicate that the C-H bonds are strengthened near boron substitutional sites. Indeed, the binding energy of hydrogen adatoms forming a dimer-like structure on the boron doped B1-B2 graphene sheet is higher than the binding energy of an isolated H(2) molecule. Since the formation of the H dimer-like structure may represent the initial stage of the hydrogen clustering process on graphene sheets, we can infer that the formation of H clusters is quite likely not only on clean graphene sheets, which is in consonance with previous studies (Hornekaer et al 2006 Phys. Rev. Lett. 97 186102), but also on B1-B2 boron doped graphene sheets. However, for a low concentration of boron atoms, the formation of H dimer structures is not expected to occur near a single substitutional boron site. That is, the formation (or not) of H clusters on graphene sheets can be tuned by the concentration of substitutional boron atoms.
Resumo:
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. All rights reserved.
Resumo:
The ever-increasing robustness and reliability of flow-simulation methods have consolidated CFD as a major tool in virtually all branches of fluid mechanics. Traditionally, those methods have played a crucial role in the analysis of flow physics. In more recent years, though, the subject has broadened considerably, with the development of optimization and inverse design applications. Since then, the search for efficient ways to evaluate flow-sensitivity gradients has received the attention of numerous researchers. In this scenario, the adjoint method has emerged as, quite possibly, the most powerful tool for the job, which heightens the need for a clear understanding of its conceptual basis. Yet, some of its underlying aspects are still subject to debate in the literature, despite all the research that has been carried out on the method. Such is the case with the adjoint boundary and internal conditions, in particular. The present work aims to shed more light on that topic, with emphasis on the need for an internal shock condition. By following the path of previous authors, the quasi-1D Euler problem is used as a vehicle to explore those concepts. The results clearly indicate that the behavior of the adjoint solution through a shock wave ultimately depends upon the nature of the objective functional.
Resumo:
We consider locally nilpotent subgroups of units in basic tiled rings A, over local rings O which satisfy a weak commutativity condition. Tiled rings are generalizations of both tiled orders and incidence rings. If, in addition, O is Artinian then we give a complete description of the maximal locally nilpotent subgroups of the unit group of A up to conjugacy. All of them are both nilpotent and maximal Engel. This generalizes our description of such subgroups of upper-triangular matrices over O given in M. Dokuchaev, V. Kirichenko, and C. Polcino Milies (2005) [3]. (C) 2010 Elsevier Inc. All rights reserved.