*
* @note If a finite element is Lagrangian, generalized support points
* and support points coincide.
- *
* </dd>
*
* <dt>@anchor GlossLagrange Lagrange elements</dt>
* <dd>The hypercube [0,1]<sup>dim</sup>, on which all parametric finite
* element shape functions are defined.</dd>
*
+ * <dt>@anchor GlossShape Shape functions</dt> <dd>The restriction of
+ * the finite element basis functions to a single grid cell.</dd>
+ *
* <dt>@anchor GlossSupport Support points</dt>
* <dd>Support points are by definition those points <i>p<sub>i</sub></i>,
* such that for the shape functions <i>v<sub>j</sub></i> holds
/**
@defgroup Iterators Iterators on mesh like containers
+ @{
deal.II has several classes which are understood conceptionally as
meshes. Apart from the obvious Triangulation, these are DoFHandler and
</table>
@section IteratorsFiltered Filtered iterators
-...
+
+Filtered iterators restrict the scope of existing iterators even
+more. For instance, you could imagine to iterate over the the subset
+of those @ref GlossActive "active cells" having their user flag set or
+belonging to a certain subdomain.
+
+This is achieved by using an object of type FilteredIterator
+<BaseIterator>, where BaseIterator usually is one of the
+standard iterators discussed above.
+
+The FilteredIterator gets an additional Predicate in its constructor
+and will skip all objects where this Predicate evaluates to
+<tt>false</tt>. A collection of already implemented predicates can be
+found in the namespace IteratorFilters.
+
*/
+/**
+@defgroup Accessors Accessor classes of the mesh iterators
+*/
+
+//@}