Up Next
Go up to Grids and grid ranges
Go forward to CartesianGrid2D Grid Type

Complex2D Grid Type

This documentation is still incomplete!
Description
The type Complex2D is a model of Grid. It allows representation of general regular 2-dimensional finite CW-complexes. That is, the cells are combinatorially equivalent to simple polygons.
Example
Complex2D G;         // empty grid
RegGrid2D R(10,10);  // 10x10 Cartesian grid
ConstructGrid0(G,R); // copy R to G;
assert(G.NumOfVertices() == R.NumOfVertices());
assert(G.NumOfCells()    == R.NumOfCells());
typedef grid_types<Complex2D> gt; // 'namespace' for Complex2D-related types 
for(gt::CellIterator c(G), ! c.IsDone(); ++c)
  cout << "Cell " << c.handle() << "  "
       << "has "  << (*c).NumOfVertices() << " verticesn";
Definition

Defined in complex2d.h.

Model of
Grid
Vertex Grid Range
Edge Grid Range
Facet Grid Range
Cell Grid Range
Members
Member Where defined Description
Types
handle types
vertex_handle Vertex Grid Range handle type corr. to Vertex
edge_handle Edge Grid Range handle type corr. to Edge
facet_handle Facet Grid Range handle type corr. to Facet
cell_handle Cell Grid Range handle type corr. to Cell
element types
Vertex Vertex Grid Range The Vertex element type
Edge Edge Grid Range The Edge element type
Facet Facet Grid Range The Facet element type
Cell Cell Grid Range The Cell element type
sequence iterator types
VertexIterator Vertex Grid Range The Sequence Iterator type for Vertex
EdgeIterator Edge Grid Range The Sequence Iterator type for Edge
FacetIterator Facet Grid Range The Sequence Iterator type for Facet
CellIterator Cell Grid Range The Sequence Iterator type for Cell
Functions
sequence iteration
VertexIterator

FirstVertex()

Vertex Grid Range Iterator pointing to the first vertex
-- same for Edge, Facet, Cell types --
sequence sizes
int NumOfVertices() Vertex Grid Range number of vertices
-- same for Edge, Facet, Cell types --
See also
Triang2D   RegGrid2D


Guntram Berti

Up Next