Regular grid

Last updated
Example of a regular grid Regular grid.svg
Example of a regular grid

A regular grid is a tessellation of n-dimensional Euclidean space by congruent parallelotopes (e.g. bricks). [1] Grids of this type appear on graph paper and may be used in finite element analysis, finite volume methods, finite difference methods, and in general for discretization of parameter spaces. Since the derivatives of field variables can be conveniently expressed as finite differences, [2] structured grids mainly appear in finite difference methods. Unstructured grids offer more flexibility than structured grids and hence are very useful in finite element and finite volume methods.

Contents

Each cell in the grid can be addressed by index (i, j) in two dimensions or (i, j, k) in three dimensions, and each vertex has coordinates in 2D or in 3D for some real numbers dx, dy, and dz representing the grid spacing.

A Cartesian grid is a special case where the elements are unit squares or unit cubes, and the vertices are points on the integer lattice.

A rectilinear grid is a tessellation by rectangles or rectangular cuboids (also known as rectangular parallelepipeds) that are not, in general, all congruent to each other. The cells may still be indexed by integers as above, but the mapping from indexes to vertex coordinates is less uniform than in a regular grid. An example of a rectilinear grid that is not regular appears on logarithmic scale graph paper.

A skewed grid is a tessellation of parallelograms or parallelepipeds. (If the unit lengths are all equal, it is a tessellation of rhombi or rhombohedra.)

A curvilinear grid or structured grid is a grid with the same combinatorial structure as a regular grid, in which the cells are quadrilaterals or [general] cuboids, rather than rectangles or rectangular cuboids.

See also

Related Research Articles

Curl (mathematics) Circulation density in a vector field

In vector calculus, the curl is a vector operator that describes the infinitesimal circulation of a vector field in three-dimensional Euclidean space. The curl at a point in the field is represented by a vector whose length and direction denote the magnitude and axis of the maximum circulation. The curl of a field is formally defined as the circulation density at each point of the field.

Parallelepiped Hexahedron with parallelogram faces

In geometry, a parallelepiped is a three-dimensional figure formed by six parallelograms. By analogy, it relates to a parallelogram just as a cube relates to a square. In Euclidean geometry, the four concepts—parallelepiped and cube in three dimensions, parallelogram and square in two dimensions—are defined, but in the context of a more general affine geometry, in which angles are not differentiated, only parallelograms and parallelepipeds exist. Three equivalent definitions of parallelepiped are

Rectangle Quadrilateral with four right angles

In Euclidean plane geometry, a rectangle is a quadrilateral with four right angles. It can also be defined as: an equiangular quadrilateral, since equiangular means that all of its angles are equal ; or a parallelogram containing a right angle. A rectangle with four sides of equal length is a square. The term oblong is occasionally used to refer to a non-square rectangle. A rectangle with vertices ABCD would be denoted as  ABCD.

Rhombus Quadrilateral in which all sides have the same length

In plane Euclidean geometry, a rhombus is a quadrilateral whose four sides all have the same length. Another name is equilateral quadrilateral, since equilateral means that all of its sides are equal in length. The rhombus is often called a "diamond", after the diamonds suit in playing cards which resembles the projection of an octahedral diamond, or a lozenge, though the former sometimes refers specifically to a rhombus with a 60° angle, and the latter sometimes refers specifically to a rhombus with a 45° angle.

Packing problems Problems which attempt to find the most efficient way to pack objects into containers

Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real-life packaging, storage and transportation issues. Each packing problem has a dual covering problem, which asks how many of the same objects are required to completely cover every region of the container, where objects are allowed to overlap.

Prism (geometry) Solid with parallel bases connected by parallelograms

In geometry, a prism is a polyhedron comprising an n-sided polygon base, a second base which is a translated copy of the first, and n other faces, necessarily all parallelograms, joining corresponding sides of the two bases. All cross-sections parallel to the bases are translations of the bases. Prisms are named after their bases, e.g. a prism with a pentagonal base is called a pentagonal prism. Prisms are a subclass of prismatoids.

In mathematics, the Hodge star operator or Hodge star is a linear map defined on the exterior algebra of a finite-dimensional oriented vector space endowed with a nondegenerate symmetric bilinear form. Applying the operator to an element of the algebra produces the Hodge dual of the element. This map was introduced by W. V. D. Hodge.

Tessellation Tiling of a plane in mathematics

A tessellation or tiling is the covering of a surface, often a plane, using one or more geometric shapes, called tiles, with no overlaps and no gaps. In mathematics, tessellation can be generalized to higher dimensions and a variety of geometries.

Schläfli symbol Notation that defines regular polytopes and tessellations

In geometry, the Schläfli symbol is a notation of the form that defines regular polytopes and tessellations.

Sinc function Special mathematical function defined as sin(x)/x

In mathematics, physics and engineering, the sinc function, denoted by sinc(x), has two forms, normalized and unnormalized.

Curvilinear coordinates Coordinate system whose directions vary in space

In geometry, curvilinear coordinates are a coordinate system for Euclidean space in which the coordinate lines may be curved. These coordinates may be derived from a set of Cartesian coordinates by using a transformation that is locally invertible at each point. This means that one can convert a point given in a Cartesian coordinate system to its curvilinear coordinates and back. The name curvilinear coordinates, coined by the French mathematician Lamé, derives from the fact that the coordinate surfaces of the curvilinear systems are curved.

Abstract polytope Poset representing certain properties of a polytope

In mathematics, an abstract polytope is an algebraic partially ordered set (poset) which captures the combinatorial properties of a traditional polytope without specifying purely geometric properties such as angles or edge lengths.

Euclidean tilings by convex regular polygons Subdivision of the plane into polygons that are all regular

Euclidean plane tilings by convex regular polygons have been widely used since antiquity. The first systematic mathematical treatment was that of Kepler in his Harmonices Mundi.

Hyperrectangle Generalization of a rectangle for higher dimensions

In geometry, an orthotope is the generalization of a rectangle to higher dimensions. It is formally defined as the Cartesian product of orthogonal intervals. A hyperrectangle is a special case of a parallelotope.

Multiple integral Generalization of definite integrals to functions of multiple variables

In mathematics, a multiple integral is a definite integral of a function of several real variables, for instance, f(x, y) or f(x, y, z). Integrals of a function of two variables over a region in are called double integrals, and integrals of a function of three variables over a region in are called triple integrals. For multiple integrals of a single-variable function, see the Cauchy formula for repeated integration.

Tetrahedral-octahedral honeycomb Quasiregular space-filling tesselation

The tetrahedral-octahedral honeycomb, alternated cubic honeycomb is a quasiregular space-filling tessellation in Euclidean 3-space. It is composed of alternating regular octahedra and tetrahedra in a ratio of 1:2.

Unstructured grid Unstructured (or irregular) grid is a tessellation of a part of the Euclidean plane

An unstructured grid or irregular grid is a tessellation of a part of the Euclidean plane or Euclidean space by simple shapes, such as triangles or tetrahedra, in an irregular pattern. Grids of this type may be used in finite element analysis when the input to be analyzed has an irregular shape.

In geometry, a hypercubic honeycomb is a family of regular honeycombs (tessellations) in n-dimensional spaces with the Schläfli symbols {4,3...3,4} and containing the symmetry of Coxeter group Rn for n ≥ 3.

Two-dimensional Euclidean space Geometric model of the planar projection of the physical universe

Two-dimensional Euclidean space or simply two-dimensional space is a geometric setting in which two values are required to determine the position of an element on the plane. The set of pairs of real numbers with appropriate structure often serves as the canonical example of a Euclidean plane, the two-dimensional Euclidean space; for a generalization of the concept, see dimension. Two-dimensional space can be seen as a projection of the physical universe onto a plane. Usually, it is thought of as a Euclidean space and the two dimensions are called length and width.

Grid or mesh is defined as smaller shapes formed after discretisation of geometric domain. Mesh or grid can be in 3- dimension and 2-dimension. Meshing has applications in the fields of geography, designing, computational fluid dynamics. and many more places. The two-dimensional meshing includes simple polygon, polygon with holes, multiple domain and curved domain. In three dimensions there are three types of inputs. They are simple polyhedron, geometrical polyhedron and multiple polyhedrons. Before defining the mesh type it is necessary to understand elements.

References

  1. Uznanski, Dan. "Grid". From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. Retrieved 25 March 2012.
  2. J.F. Thompson, B. K . Soni & N.P. Weatherill (1998). Handbook of Grid Generation. CRC-Press. ISBN   978-0-8493-2687-5.