|
Functions | |
| template<class GRID , class GERMS > | |
| void | GrAL::calculate_vertex_stars (GRID const &G,GERMS &germs) |
| Get a germ flag for the star of each vertex of G. | |
| template<class GRID , class GERMS , class DET > | |
| void | GrAL::calculate_positive_vertex_stars (GRID const &G,GERMS &germs,DET const &det) |
| Get a germ flag for the star of each vertex of G. | |
A vertex star is the set of higher-dimensional elements incident to the vertex.
| void GrAL::calculate_vertex_stars | ( | GRID const & | G, | |
| GERMS & | germs | |||
| ) | [inline] |
Get a germ flag for the star of each vertex of G.
The algorithm uses only downward incidence iterators. It can be used e.g. for implementing upward incidence iterators on vertices with minimal storage requirements.
VertexOnFacetIterator and FacetOnCellIterator grid_function<GRID::Vertex, flag<GRID> >
Definition at line 28 of file calculate-vertex-stars.C.
Referenced by GrAL::calculate_positive_vertex_stars().
| void GrAL::calculate_positive_vertex_stars | ( | GRID const & | G, | |
| GERMS & | germs, | |||
| DET const & | det | |||
| ) | [inline] |
Get a germ flag for the star of each vertex of G.
jacc).
Definition at line 40 of file calculate-vertex-stars.C.
References GrAL::calculate_vertex_stars().
1.5.8