From: Wolfgang Bangerth <bangerth@colostate.edu>
Date: Tue, 15 Aug 2017 20:12:24 +0000 (-0600)
Subject: Update documentation to mention a published article.
X-Git-Tag: v9.0.0-rc1~1242^2
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=refs%2Fpull%2F4864%2Fhead;p=dealii.git

Update documentation to mention a published article.
---

diff --git a/include/deal.II/grid/grid_reordering.h b/include/deal.II/grid/grid_reordering.h
index 8e81d1c27c..5db849b284 100644
--- a/include/deal.II/grid/grid_reordering.h
+++ b/include/deal.II/grid/grid_reordering.h
@@ -470,18 +470,18 @@ DeclExceptionMsg (ExcMeshNotOrientable,
  * It is obvious that this algorithm has linear run-time, since it only ever
  * touches each face exactly once.
  *
- * The algorithm just described is implemented in a specialization of this
- * class for the 2d case. A similar, but slightly more complex algorithm is
- * implemented in a specialization for 3d. It using sheets instead of strings
- * of cells to work on. If a grid is orientable, then the algorithm is able to
- * do its work in linear time; if it is not orientable, then it aborts in
+ * The algorithm just described in the two-dimensional case is
+ * implemented for both 2d and (in generalized form) for 3d in this
+ * class. The 3d case uses sheets instead of strings of cells to work
+ * on. If a grid is orientable, then the algorithm is able to do its
+ * work in linear time; if it is not orientable, then it aborts in
  * linear time as well.
  *
  * Both algorithms are described in the paper "On orienting edges of
- * unstructured two- and three-dimensional meshes", R. Agelek, M. Anderson, W.
- * Bangerth, W. L. Barth, accepted for publication in the ACM Transactions
- * on Mathematical Software. A preprint is available as <a
- * href="http://arxiv.org/abs/1512.02137">arxiv
+ * unstructured two- and three-dimensional meshes", R. Agelek,
+ * M. Anderson, W.  Bangerth, W. L. Barth, ACM Transactions on
+ * Mathematical Software, vol. 44, article 5, 2017. A preprint is
+ * available as <a href="http://arxiv.org/abs/1512.02137">arxiv
  * 1512.02137</a>.
  *
  *
diff --git a/include/deal.II/grid/tria_objects.h b/include/deal.II/grid/tria_objects.h
index 8e13f4c02d..70868c65b5 100644
--- a/include/deal.II/grid/tria_objects.h
+++ b/include/deal.II/grid/tria_objects.h
@@ -430,13 +430,15 @@ namespace internal
 
 
       /**
-       * For edges, we enforce a standard convention that opposite edges
-       * should be parallel. Now, that's enforceable in most cases, and we
-       * have code that makes sure that if a mesh allows this to happen, that
-       * we have this convention. We also know that it is always possible to
-       * have opposite faces have parallel normal vectors. (For both things,
-       * see the Agelek, Anderson, Bangerth, Barth paper mentioned in the
-       * documentation of the GridReordering class.)
+       * For edges, we enforce a standard convention that opposite
+       * edges should be parallel. Now, that's enforceable in most
+       * cases, and we have code that makes sure that if a mesh allows
+       * this to happen, that we have this convention. We also know
+       * that it is always possible to have opposite faces have
+       * parallel normal vectors. (For both things, see the paper by
+       * Agelek, Anderson, Bangerth, Barth in the ACM Transactions on
+       * Mathematical Software mentioned in the documentation of the
+       * GridReordering class.)
        *
        * The problem is that we originally had another condition, namely that
        * faces 0, 2 and 6 have normals that point into the cell, while the