Grid Concept

Grid Concept

Description

The mathematical concept underlying Grid is that of (a subset of) a (finite) CW-complex. Some well-known specialization of this concept are triangulations, boundary complexes of convex polytopes and Cartesian grids.

Refinement of

Grid Range

The main difference to grid ranges is that grids stand for their own -- there is no underlying base grid. This means that all grid entities produced by calls to member functions of a grid g refer to g with their grid anchor references.

Virtually all algorithms can do with grid ranges, they do not require grids.

Notation

G is a type which is a model of grid

Associated types

Refinements

Grid-With-Boundary

Models

Triang2D
Complex2D

Notes

1. Technically, these types are bundled in a struct grid_types<G> which is used by the algorithms to access these types. This opens up the possibility to parameterize algorithms by such a traits class like grid_types<G> , thereby introducing different iterator and element types, for example counting iterators or debug iterators producing graphical output.

See also

Grid Range   Grid Element   Grid Sequence Iterator

Grid Concept