Go backward to Grid Range Concept
Go up to Grids and Grid Ranges
Go forward to Cell-Vertex Input Grid Range
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.
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.
G is a type which is a model of grid
|
|
|
Name | Expression | Description |
|
base grid | G::grid_type | identical to G |
|
|
|
|
Grid-With-Boundary
Triang2D
Complex2D
- 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.
Grid Range
Grid Element
Grid Sequence Iterator
Guntram Berti