Finite-Element Analysis for the Naive User

Wördenweber, Burkard

doi:10.1007/978-1-4613-2811-7_4

Cited by 8 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let 1, be node 'Original exterior boundary nodes are never free to move §These are usually boundary side nodes. As such, they constitute a majority of most boundary nodes during paving N<s desired length, which is the length of the projection vector used to initially generate the node as defined by equations (l), (2) and (5). Let 1, be the length of a vector V, from N j to the new location of N i determined from the isoparametric smooth (i.e.…”

Section: Smoothingmentioning

confidence: 99%

Paving: A new approach to automated quadrilateral mesh generation

Blacker

Stephenson

1991

Numerical Meth Engineering

444

185

View full text Add to dashboard Cite

SUMMARYThis paper presents a new mesh generation technique, paving, which meshes arbitrary 2-D geometries with an all-quadrilateral mesh. Paving allows varying element size distributions on the boundary as well as the interior of a region. The generated mesh is well formed (i.e. nearly square elements, elements perpendicular to boundaries, etc.) and geometrically pleasing (i.e. mesh contours tend to follow geometric contours of the boundary). In this paper we describe the theory behind this algorithmic/heuristic technique, evaluate the performance of the approach and present examples of automatically generated meshes.

show abstract

Section: Smoothingmentioning

confidence: 99%

Paving: A new approach to automated quadrilateral mesh generation

Blacker

Stephenson

1991

Numerical Meth Engineering

444

185

View full text Add to dashboard Cite

show abstract

Automatic mesh generation from solid models based on recursive spatial decompositions

Perucchio

Saxena

Kela

1989

Numerical Meth Engineering

View full text Add to dashboard Cite

SUMMARYThis paper introduces a two-stage algorithm for the automatic conversion of solid models into finitc element meshes. In Stage 1 the solid is approximated by a collection of variably sized cells generated by recursive spatial decomposition and stored in a logical tree. In Stage 2 the approximating cell structure, which includes cells that are wholly inside the solid (IN) as well as cells that are neither inside nor outside (NIO), is transformed into a finite element model. I N cells are directly mapped into finite elements while NIO cells are dccornposed according to their topologically complexity through either template mapping or recursive element extraction. Although specifically designed for adaptive remeshing, the algorithm is of general use and can be implemented in any Solid Modelling System that supports Boolean operations on solids and maintains a complete boundary representation. Core algorithms for Stages 1 and 2 are rigorously developed to insure their applicability within a genuinely automatic procedure. Specific issues related to boundary evaluation and decomposition procedures are identified and discussed. The implementation of the algorithm into an experimental system based on the PADL-2 solid modcller is described. The paper concludes with a comparative study of existing meshing algorithms based on recursive spatial decompositions.

show abstract

Functionality in Solids Obtained from Partial Differential Equations

Bloor

Wilson²

1993

Geometric Modelling

View full text Add to dashboard Cite

Finite-Element Analysis for the Naive User

Cited by 8 publications

References 9 publications

Paving: A new approach to automated quadrilateral mesh generation

Paving: A new approach to automated quadrilateral mesh generation

Automatic mesh generation from solid models based on recursive spatial decompositions

Functionality in Solids Obtained from Partial Differential Equations

Contact Info

Product

Resources

About