![]() This has the big advantage that the layout of the attribute and simulation grid can be customized to their individual requirements. The actual simulation is performed on a separate simulation grid, which can be handled independently from these attribute grids. Ortho grid several attribute values can be stored. Ortho grids are a common way to provide attributes, such as dopant concentrations. ![]() Adding special terminating lines criteria within these generated triangles, a valid triangular (tetrahedral) Delaunay mesh can be built. Each rectangle can be split in two triangles, each cuboid can be split into five or six tetrahedrons.Īs a side effect, this decomposition fulfills the Delaunay criterion, which is relevant for certain numerical schemes as mentioned previously. This generally will reduce the amount of grid points while better approximating the geometry.įurthermore, since ortho grids can be split into triangles (or tetrahedra for three dimensions), there is no need to store rectangles any longer. However, if triangles or tetrahedrons are provided, they can also be provided at the geometry edges, which is shown in the region near the fat boundary edges of Figure 2.2. As such rectangles (cuboids) usually are not supported, they must be split into triangles (tetrahedrons) to satisfy the connectivity. Grid lines, which are needed in one region only, can terminate inside the simulation domain.Īt the termination points, rectangles (cuboids) with additional points on the sides arise. Each additional coordinate tick will result in an unacceptable number of unwanted grid points.Īs a solution to this dilemma, it can be useful to allow triangular or tetrahedral elements, too. To achieve the desired resolution of those edges which are non-parallel to the coordinate axes these lines must be approximated by small steps.Ī negative side effect of this method is that the amount of grid points will rise dramatically. ![]() They must be approximated by steps in the geometry, as sketched in Figure 2.1 for a two dimensional example of an ortho grid. This may pose an unacceptable computational burden in terms of CPU-time and memory consumption.Įspecially with non-planar geometries, there is no way to reproduce such non-planar surfaces. Points wide grid, where, , and denote the number of ticks in the three coordinate directions, will produce a grid with However, with complex geometrical structures the limits of this method are quickly reached. If all edges of the geometry of the structure are parallel to the coordinate axes, we will find an acceptable mesh for this domain.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |