A grid usually refers to two or more infinite sets of evenly-spaced parallel lines at particular angles to each other in a plane, or the intersections of such lines.

The two most common types of grid are orthogonal grids, with two sets of lines perpendicular to each other (such as the square grid), and isometric grids, with three sets of lines at 60-degree angles to each other (such as the triangular grid). It should be noted that in most grids with three or more sets of lines, every intersection includes one element of each set.

There are other types of planar grids, like hexagonal grids, which are formed by tessellating regular hexagons in the plane. These are often found in strategy and role-playing games because of the lack of single points of contact characteristic of isometric and orthogonal grids. The collection of cells created by a grid is often called a "board" when these cells are used as resting places for pieces in a game.

Grids can be generalized into n-dimensional space by using the centers of packed n-spheres or n-cubes as the points.

See also

Board, Finite Element Method, Hexagonal Grid, Lattice Point, Square Grid, Triangular Grid

This entry contributed by Dan Uznanski

Explore with Wolfram|Alpha


Bern, M. W.; Flaherty, J. E.; and Luskin, M. (Eds.). Grid Generation and Adaptive Algorithms. New York: Springer-Verlag, 1999.Liseikin, V. D. Grid Generation Methods. Berlin: Springer-Verlag, 1999.

Referenced on Wolfram|Alpha


Cite this as:

Uznanski, Dan. "Grid." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein.

Subject classifications