Grid Concept |
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.
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.
G is a type which is a model of grid
Name | Expression | Description |
base grid | G::grid_type | identical to G |
Grid Range Grid Element Grid Sequence Iterator
Grid Concept |