From 4cd0c1929c1df731657ce3e9a3a99b067401887e Mon Sep 17 00:00:00 2001
From: Wolfgang Bangerth <bangerth@colostate.edu>
Date: Fri, 28 Oct 2016 09:36:45 -0600
Subject: [PATCH] Add changelog entry for edge orientation code.

While there, also update a couple of comments.
---
 doc/news/changes.h                     | 8 ++++++++
 include/deal.II/grid/grid_reordering.h | 9 +++++----
 2 files changed, 13 insertions(+), 4 deletions(-)

diff --git a/doc/news/changes.h b/doc/news/changes.h
index df10b5e320..caf4f6624a 100644
--- a/doc/news/changes.h
+++ b/doc/news/changes.h
@@ -215,6 +215,14 @@ inconvenience this causes.
 <h3>General</h3>
 
 <ol>
+ <li> Improved: The code in class GridReordering has been rewritten from
+ scratch. It now follows the algorithm described in the paper by
+ Agelek, Anderson, Bangerth and Barth mentioned in the documentation
+ of that class.
+ <br>
+ (Wolfgang Bangerth, 2016/10/28)
+ </li>
+
  <li> Improved: deal.II now bundles a subset of BOOST 1.62 instead of a subset
  of BOOST 1.56.
  <br>
diff --git a/include/deal.II/grid/grid_reordering.h b/include/deal.II/grid/grid_reordering.h
index 8885450353..21d37ce8a7 100644
--- a/include/deal.II/grid/grid_reordering.h
+++ b/include/deal.II/grid/grid_reordering.h
@@ -479,15 +479,16 @@ DeclExceptionMsg (ExcMeshNotOrientable,
  *
  * 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 (submitted, 2015). A preprint is available as <a
+ * Bangerth, W. L. Barth (submitted, 2016). A preprint is available as <a
  * href="http://arxiv.org/abs/1512.02137">arxiv
  * 1512.02137</a>.
  *
  *
  * <h3>For the curious</h3>
  *
- * Prior to the implementation of the algorithms developed by Michael Anderson
- * and described above, we used a branch-and-cut algorithm initially
+ * Prior to the implementation of the algorithms described above (originally
+ * implemented by Michael Anderson in 2002, and re-implemented by Wolfgang
+ * Bangerth in 2016), we used a branch-and-cut algorithm initially
  * implemented in 2000 by Wolfgang Bangerth. Although it is no longer used,
  * here is how it works, and why it doesn't always work for large meshes since
  * its run-time can be exponential in bad cases.
@@ -624,7 +625,7 @@ DeclExceptionMsg (ExcMeshNotOrientable,
  * Triangulation::create_triangulation() function.
  *
  * @ingroup grid
- * @author Wolfgang Bangerth, 2000, Michael Anderson 2003, Ralf Hartmann 2005
+ * @author Wolfgang Bangerth, 2000, 2016, Michael Anderson 2003
  */
 template <int dim, int spacedim=dim>
 class GridReordering
-- 
2.39.5