From c2cb44175b73b32b1573c01e405dba98a8461543 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 26 Aug 2019 13:24:51 +0200
Subject: [PATCH] Add a reference to the paper

---
 .../include/CGAL/Polygon_mesh_processing/compute_normal.h       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h
index 72a31119418..ac0351b6811 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h
@@ -464,7 +464,7 @@ compute_most_visible_normal_3_points(const std::vector<typename boost::graph_tra
   return n;
 }
 
-// Complexity is high, but valence is usually low, so that's ok
+// Inspired by Aubry et al. On the most 'normal' normal
 template <typename PolygonMesh, typename FaceNormalVector, typename GT>
 typename GT::Vector_3
 compute_vertex_normal_most_visible_min_circle(typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,