Home About us Contact | |||
Background Grid (background + grid)
Selected AbstractsA meshless Total Lagrangian explicit dynamics algorithm for surgical simulationINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN BIOMEDICAL ENGINEERING, Issue 8 2010Ashley Horton Abstract A method is presented for computing deformation of very soft tissue. The method is motivated by the need for simple, automatic model creation for real-time simulation. The method is meshless in the sense that deformation is calculated at nodes that are not part of an element mesh. Node placement is almost arbitrary. Fully geometrically nonlinear Total Lagrangian formulation is used. Geometric integration is performed over a regular background grid that does not conform to the simulation geometry. Explicit time integration is used via the central difference method. As an example the simple but fully nonlinear Neo-Hookean material model is employed. The results are compared with a finite element simulation to verify the usefulness of the method. Copyright © 2010 John Wiley & Sons, Ltd. [source] A new fast hybrid adaptive grid generation technique for arbitrary two-dimensional domainsINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 3 2010Mohamed S. Ebeida Abstract This paper describes a new fast hybrid adaptive grid generation technique for arbitrary two-dimensional domains. This technique is based on a Cartesian background grid with square elements and quadtree decomposition. A new algorithm is introduced for the distribution of boundary points based on the curvature of the domain boundaries. The quadtree decomposition is governed either by the distribution of the boundary points or by a size function when a solution-based adaptive grid is desired. The resulting grid is quaddominant and ready for the application of finite element, multi-grid, or line-relaxation methods. All the internal angles in the final grid have a lower bound of 45° and an upper bound of 135°. Although our main interest is in grid generation for unsteady flow simulations, the technique presented in this paper can be employed in many other fields. Several application examples are provided to illustrate the main features of this new approach. Copyright © 2010 John Wiley & Sons, Ltd. [source] A feature-preserving volumetric technique to merge surface triangulationsINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 2 2002Juan R. Cebral Abstract Several extensions and improvements to surface merging procedures based on the extraction of iso-surfaces from a distance map defined on an adaptive background grid are presented. The main objective is to extend the application of these algorithms to surfaces with sharp edges and corners. In order to deal with objects of different length scales, the initial background grids are created using a Delaunay triangulation method and local voxelizations. A point enrichment technique that introduces points into the background grid along detected surface features such as ridges is used to ensure that these features are preserved in the final merged surface. The surface merging methodology is extended to include other Boolean operations between surface triangulations. The iso-surface extraction algorithms are modified to obtain the correct iso-surface for multi-component objects. The procedures are demonstrated with various examples, ranging from simple geometrical entities to complex engineering applications. The present algorithms allow realistic modelling of a large number of complex engineering geometries using overlapping components defined discretely, i.e. via surface triangulations. This capability is very useful for grid generation starting from data originated in measurements or images. Copyright © 2002 John Wiley & Sons, Ltd. [source] |