Leave more references to step-65 in a variety of places.

diff --git a/examples/step-6/doc/results.dox b/examples/step-6/doc/results.dox
index 9771464ea77a1ff4f4e204be4299f76952f74d0c..9d4f1b327446cb30607959b2588dc94ea4b24f16 100644 (file)
--- a/examples/step-6/doc/results.dox
+++ b/examples/step-6/doc/results.dox
@@ -412,7 +412,9 @@ This code then generates the following, much better sequence of meshes:
 Creating good meshes, and in particular making them fit the geometry you
 want, is a complex topic in itself. You can find much more on this in
 step-49, step-53, and step-54, among other tutorial programs that cover
-the issue. Information on curved domains can also be found in the
+the issue. step-65 shows another, less manual way to achieve a mesh
+well fit to the problem here.
+Information on curved domains can also be found in the
 documentation module on @ref manifold "Manifold descriptions".
 
 Why does it make sense to choose a mesh that tracks the internal

diff --git a/examples/step-65/doc/intro.dox b/examples/step-65/doc/intro.dox
index 4724dcc3fb229412723821bbd4af6dcfcd702172..75e8cfd8028046b5142c56881dc71375df38f4a7 100644 (file)
--- a/examples/step-65/doc/intro.dox
+++ b/examples/step-65/doc/intro.dox
@@ -79,7 +79,7 @@ suitable averages of the surrounding points in the Cartesian coordinate system
 
 At this point, one might assume that curved volume descriptions are the way to
 go. This is generally not wrong, though it is sometimes not so easy to
-describe how exactly this should work. Here are couple examples:
+describe how exactly this should work. Here are a couple of examples:
 
 - Imagine that the mesh above had actually been a disk, not just a ring.
   In that case the polar manifold degenerates at the origin and
@@ -373,7 +373,7 @@ numerical solution. If the degree of the geometry is higher or lower than the
 solution, one calls that a super- or sub-parametric geometry representation,
 respectively. In deal.II, the standard class for polynomial representation is
 MappingQGeneric. If, for example, this class is used with polynomial degree $4$ in 3D, a
-total of 125 ($=(4+1)^3$) points are needed for the tri-cubic
+total of 125 ($=(4+1)^3$) points are needed for the
 interpolation. Among these points, 8 are the mesh vertices and already
 available from the mesh, but the other 117 need to be provided by the
 manifold. In case the transfinite interpolation manifold is used, we can

diff --git a/include/deal.II/fe/mapping_q_cache.h b/include/deal.II/fe/mapping_q_cache.h
index 9f6798142538ca4a49fcdf6144dce079a14d8bdc..dbf654000f746346427e718ee798a08c86f3248f 100644 (file)
--- a/include/deal.II/fe/mapping_q_cache.h
+++ b/include/deal.II/fe/mapping_q_cache.h
@@ -38,6 +38,8 @@ DEAL_II_NAMESPACE_OPEN
  * which is used in all operations of MappingQGeneric. The information of the
  * mapping is pre-computed by the MappingQCache::initialize() function.
  *
+ * The use of this class is discussed extensively in step-65.
+ *
  * @author Martin Kronbichler, 2019
  */
 template <int dim, int spacedim = dim>

diff --git a/include/deal.II/grid/manifold_lib.h b/include/deal.II/grid/manifold_lib.h
index d9ac04ba2bd056bdf9a64ee8a72f4f461033ed27..7094b3a113f2347ebc1029515045b434a8849cc3 100644 (file)
--- a/include/deal.II/grid/manifold_lib.h
+++ b/include/deal.II/grid/manifold_lib.h
@@ -213,7 +213,7 @@ private:
  * Manifold to the cell containing the center. It is advisable to combine this
  * class with TransfiniteInterpolationManifold to ensure a smooth transition
  * from a curved shape to the straight coordinate system in the center of the
- * ball.
+ * ball. (See also the extensive discussion in step-65.)
  *
  * @ingroup manifold
  *
@@ -805,6 +805,7 @@ private:
  * assumed to be given by another manifold (e.g. a polar manifold on a circle).
  * The mechanism to extend the boundary information is a so-called transfinite
  * interpolation.
+ * The use of this class is discussed extensively in step-65.
  *
  * The formula for extending such a description in 2D is, for example,
  * described on