diff --git a/Packages/Triangulation_2/include/CGAL/Constrained_triangulation_face_base_2.h b/Packages/Triangulation_2/include/CGAL/Constrained_triangulation_face_base_2.h
index 3288b408fae..80413141795 100644
--- a/Packages/Triangulation_2/include/CGAL/Constrained_triangulation_face_base_2.h
+++ b/Packages/Triangulation_2/include/CGAL/Constrained_triangulation_face_base_2.h
@@ -139,7 +139,7 @@ cw_permute()
 template <class Gt>
 inline bool
 Constrained_triangulation_face_base_2<Gt>::
-is_valid(bool verbose = false, int level = 0) const
+is_valid(bool verbose, int level) const
 {
   bool result = Fab::is_valid(verbose, level);
   CGAL_triangulation_assertion(result);
diff --git a/Packages/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h b/Packages/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h
index 2673f320b1b..912d1f7fc67 100644
--- a/Packages/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h
+++ b/Packages/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h
@@ -134,7 +134,7 @@ public:
 template < class Gt, class Tds >
 bool
 Delaunay_triangulation_2<Gt,Tds>::
-is_valid(bool verbose = false, int level = 0) const
+is_valid(bool verbose, int level) const
 {
   bool result = Triangulation_2<Gt,Tds>::is_valid(verbose, level);
 
diff --git a/Packages/Triangulation_2/include/CGAL/Regular_triangulation_2.h b/Packages/Triangulation_2/include/CGAL/Regular_triangulation_2.h
index 4c6fe1f8735..48d0789f107 100644
--- a/Packages/Triangulation_2/include/CGAL/Regular_triangulation_2.h
+++ b/Packages/Triangulation_2/include/CGAL/Regular_triangulation_2.h
@@ -217,7 +217,7 @@ power_test(const Face_handle& f, int i,
 template < class Gt, class Tds >
 bool
 Regular_triangulation_2<Gt,Tds>::
-is_valid(bool verbose = false, int level = 0) const
+is_valid(bool verbose, int level) const
 {
   if (number_of_vertices() <= 1)    return true; 
   bool result = Triangulation_2<Gt,Tds>::is_valid(verbose, level);
diff --git a/Packages/Triangulation_2/include/CGAL/Triangulation_2.h b/Packages/Triangulation_2/include/CGAL/Triangulation_2.h
index f6c2c3c92f3..50905926f01 100644
--- a/Packages/Triangulation_2/include/CGAL/Triangulation_2.h
+++ b/Packages/Triangulation_2/include/CGAL/Triangulation_2.h
@@ -421,7 +421,7 @@ infinite_face() const
 template <class Gt, class Tds >
 bool
 Triangulation_2<Gt, Tds>::
-is_valid(bool verbose = false, int level = 0) const
+is_valid(bool verbose, int level) const
 {
   bool result = _tds.is_valid(verbose, level);
   if (dimension() <= 0 ||
diff --git a/Packages/Triangulation_2/include/CGAL/Triangulation_line_face_circulator_2.h b/Packages/Triangulation_2/include/CGAL/Triangulation_line_face_circulator_2.h
index 807d5ec7d68..150c9644fc8 100644
--- a/Packages/Triangulation_2/include/CGAL/Triangulation_line_face_circulator_2.h
+++ b/Packages/Triangulation_2/include/CGAL/Triangulation_line_face_circulator_2.h
@@ -314,7 +314,7 @@ Triangulation_line_face_circulator_2(const Point& pp,
 				     const Point& qq,
 				     const Face_handle& ff,
 				     const Triangulation_2<Gt,Tds>* t)
-  : Face::Face_handle(ff), _tr(t), s(undefined), p(pp), q(qq)
+  : Face_handle(ff), _tr(t), s(undefined), p(pp), q(qq)
   //begin the walk at face ff which has to contain pp
 {
   CGAL_triangulation_precondition(_tr->is_infinite(ff) ||