{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

This unites mesh generation and adaptive mesh re

Info icon This preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: tree data structure 2]. The underlying tree structure is also suitable for load balancing on a parallel computer 8, 7]. The advancing front technique constructs a mesh by \notching" elements from @ and propagating this process into the interior of the domain. An example is shown in Figure 5.2.7. This procedure provides better shape control than quadtree or octree but problems arise as the advancing fronts intersect. Lohner 10] has a description of this and other mesh generation techniques. Carey 6] presents a more recent treatment of mesh generation. Figure 5.2.7: Mesh generation by the advancing front technique. 5.3 Data Structures Unstructured mesh computation requires a data structure to store the geometric information. There is some ambiguity concerning the information that should be computed at the preprocessing stage, but, at the very least, the processing module would have to know the vertices belonging to each element, the spatial coordinates of each vertex, and the element edges, faces, or vertices that are on @ . The processing module would need more information when adaptivity is performed. It, for example, would need a link to the geometric information in order to re ne elements 10 Mesh Generation and Assembly along a curved boundary. Even without adaptivity, the processing software may want access to geometric information when using elements with curved edges or faces (cf. Section 5.4). If the nite element basis were known at the preprocessing stage, space could be reserved for edge and interior nodes or for a symbolic factorization of the resulting algebraic system (cf. Chapter 11). Beall and Shephard 4] introduced a database and data structure that have great exibility. It is suitable for use with high-order and hierarchical bases, adaptive mesh re nement and/or order variation, and arbitrarily complex domains. It has a hierarchical structure with three-dimensional elements (regions) having pointers to their bounding faces, faces having pointers to their bounding edges, and edges having pointers to their bounding vertices. Those mesh entities (elements, faces, edges, and vertices) on domain...
View Full Document

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern