diff --git a/Packages/Triangulation_2/include/CGAL/Triangulation_2.h b/Packages/Triangulation_2/include/CGAL/Triangulation_2.h
index 1bd22ff1451..fbb5e5742b4 100644
--- a/Packages/Triangulation_2/include/CGAL/Triangulation_2.h
+++ b/Packages/Triangulation_2/include/CGAL/Triangulation_2.h
@@ -762,7 +762,7 @@ void   make_hole ( Vertex_handle v, list<Edge> & hole)
 	 in = fn->index(f);
 	 vv = f->vertex(cw(i));
 	 if( vv->face()==  f) vv->set_face(fn);
-	 vv = fc->vertex(ccw(i));
+	 vv = f->vertex(ccw(i));
 	 if( vv->face()== f) vv->set_face(fn);
 	 fn->set_neighbor(in, NULL);
 	 hole.push_back(Edge(fn,in));
diff --git a/Packages/Triangulation_2/include/CGAL/Triangulation_default_data_structure_2.h b/Packages/Triangulation_2/include/CGAL/Triangulation_default_data_structure_2.h
index 00155711420..713778dc51b 100644
--- a/Packages/Triangulation_2/include/CGAL/Triangulation_default_data_structure_2.h
+++ b/Packages/Triangulation_2/include/CGAL/Triangulation_default_data_structure_2.h
@@ -475,8 +475,10 @@ public:
     list<Face* > to_delete;
     list<Face* > to_downgrade;
     Face_iterator fit = faces_begin();
-    if ( ! fit->has_vertex(v) ) { to_delete.push_back(&(*fit));}
-    else { to_downgrade.push_back(&(*fit));}
+    for( ; fit != faces_end(); fit++){
+      if ( ! fit->has_vertex(v) ) { to_delete.push_back(&(*fit));}
+      else { to_downgrade.push_back(&(*fit));}
+    }
 
     list<Face*>::iterator lfit = to_downgrade.begin();
     int j;