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

Misc minor changes

This commit is contained in:
Mael Rouxel-Labbé 2017-12-01 18:33:05 +01:00
parent a843cf0530
commit c6a91e3281
3 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
View File

@ -460,7 +460,7 @@ void
Protect_edges_sizing_field<C3T3, MD, Sf>:: Protect_edges_sizing_field<C3T3, MD, Sf>::
operator()(const bool refine) operator()(const bool refine)
{ {
// This file is only meant to be used with non-periodic triangulations // This class is only meant to be used with non-periodic triangulations
CGAL_assertion(!(boost::is_same<typename Tr::Periodic_tag, CGAL::Tag_true>::value)); CGAL_assertion(!(boost::is_same<typename Tr::Periodic_tag, CGAL::Tag_true>::value));
#ifdef CGAL_MESH_3_VERBOSE #ifdef CGAL_MESH_3_VERBOSE

2
Mesh_3/include/CGAL/Mesh_3/Triangulation_helpers.h
View File

@ -156,7 +156,7 @@ public:
const Cell_vector& incident_cells, const Cell_vector& incident_cells,
typename boost::enable_if_c<Tag::value>::type* = NULL) const; typename boost::enable_if_c<Tag::value>::type* = NULL) const;
// @todo are the two versions really worth it, I can't even tell the difference... // @todo are the two versions really worth it, I can't tell the difference from a time POV...
template<typename Tag> template<typename Tag>
FT get_sq_distance_to_closest_vertex(const Tr& tr, FT get_sq_distance_to_closest_vertex(const Tr& tr,
const Vertex_handle& vh, const Vertex_handle& vh,

10
Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
View File

@ -574,7 +574,7 @@ void
Protect_edges_sizing_field<C3T3, MD, Sf>:: Protect_edges_sizing_field<C3T3, MD, Sf>::
operator()(const bool refine) operator()(const bool refine)
{ {
// This file is only meant to be used with periodic triangulations // This class is only meant to be used with periodic triangulations
CGAL_assertion((boost::is_same<typename Tr::Periodic_tag, CGAL::Tag_true>::value)); CGAL_assertion((boost::is_same<typename Tr::Periodic_tag, CGAL::Tag_true>::value));
#ifdef CGAL_MESH_3_VERBOSE #ifdef CGAL_MESH_3_VERBOSE
@ -613,7 +613,7 @@ operator()(const bool refine)
#endif #endif
// The assertion below is disabled because c3t3.is_valid() may return false // The assertion below is disabled because c3t3.is_valid() may return false
// positive for periodic triangulations, specifically because of the line: // positives for periodic triangulations, specifically because of the line:
// ' if(! do_intersect(sphere(p, sq_rp), sphere(q, sq_rq))) ... ' // ' if(! do_intersect(sphere(p, sq_rp), sphere(q, sq_rq))) ... '
// which does not take periodicity into account // which does not take periodicity into account
// CGAL_assertion(minimal_size_ > 0 || c3t3_.is_valid()); // CGAL_assertion(minimal_size_ > 0 || c3t3_.is_valid());
@ -957,7 +957,7 @@ get_positions_with_unknown_orientation(const Vertex_handle v1,
const Vertex_handle v2, const Vertex_handle v2,
const Curve_index& curve_index) const const Curve_index& curve_index) const
{ {
// We don't know the orientation ! This is problematic if a vertex corresponds // We don't know the orientation! This is problematic if a vertex corresponds
// to two points (extremity of a periodic loop). // to two points (extremity of a periodic loop).
CGAL::Orientation orientation = CGAL::ZERO; CGAL::Orientation orientation = CGAL::ZERO;
return get_positions(v1, v2, curve_index, orientation); return get_positions(v1, v2, curve_index, orientation);
@ -3152,8 +3152,8 @@ repopulate_edges_around_corner(const Vertex_handle& v, ErasedVeOutIt out)
return out; return out;
} }
} // end namespace Periodic_3_mesh_3 } // namespace Periodic_3_mesh_3
} //namespace CGAL } // namespace CGAL
#endif // CGAL_PERIODIC_3_MESH_3_PROTECT_EDGES_SIZING_FIELD_H #endif // CGAL_PERIODIC_3_MESH_3_PROTECT_EDGES_SIZING_FIELD_H