songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Add a reference to the paper

This commit is contained in:
Mael Rouxel-Labbé 2019-08-26 13:24:51 +02:00
parent 61ef88f2de
commit c2cb44175b
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h
View File

@ -464,7 +464,7 @@ compute_most_visible_normal_3_points(const std::vector<typename boost::graph_tra
return n; 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> template <typename PolygonMesh, typename FaceNormalVector, typename GT>
typename GT::Vector_3 typename GT::Vector_3
compute_vertex_normal_most_visible_min_circle(typename boost::graph_traits<PolygonMesh>::vertex_descriptor v, compute_vertex_normal_most_visible_min_circle(typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,