diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/hole_filling_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/hole_filling_example.cpp
index f18657b5d50..f8b58e71baa 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/hole_filling_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/hole_filling_example.cpp
@@ -45,10 +45,10 @@ int main(int argc, char* argv[])
      CGAL::Polygon_mesh_processing::parameters::vertex_point_map(get(CGAL::vertex_point, poly)).
                   geom_traits(Kernel())) );
 
-      std::cout << "* Number of facets in constructed patch: " << patch_facets.size() << std::endl;
-      std::cout << "  Number of vertices in constructed patch: " << patch_vertices.size() << std::endl;
-      std::cout << "  Is fairing successful: " << success << std::endl;
-      nb_holes++;
+      std::cout << " Number of facets in constructed patch: " << patch_facets.size() << std::endl;
+      std::cout << " Number of vertices in constructed patch: " << patch_vertices.size() << std::endl;
+      std::cout << " Fairing : " << (success ? "succeeded" : "failed") << std::endl;
+      ++nb_holes;
     }
   }
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangulate_polyline_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangulate_polyline_example.cpp
index 74379b5501a..9564cc89c98 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangulate_polyline_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangulate_polyline_example.cpp
@@ -6,16 +6,16 @@
 #include <iterator>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
-typedef Kernel::Point_3 Point_3;
+typedef Kernel::Point_3 Point;
 
 int main()
 {
-  std::vector<Point_3> polyline;
-  polyline.push_back(Point_3( 1.,0.,0.));
-  polyline.push_back(Point_3( 0.,1.,0.));
-  polyline.push_back(Point_3(-1.,0.,0.));
-  polyline.push_back(Point_3( 1.,1.,0.));
-  // repeating first point (i.e. polyline.push_back(Point_3(1.,0.,0.)) ) is optional
+  std::vector<Point> polyline;
+  polyline.push_back(Point( 1.,0.,0.));
+  polyline.push_back(Point( 0.,1.,0.));
+  polyline.push_back(Point(-1.,0.,0.));
+  polyline.push_back(Point( 1.,1.,0.));
+  // repeating first point (i.e. polyline.push_back(Point(1.,0.,0.)) ) is optional
 
   // any type, having Type(int, int, int) constructor available, can be used to hold output triangles
   typedef CGAL::Triple<int, int, int> Triangle_int;
@@ -33,12 +33,12 @@ int main()
       << std::endl;
   }
 
-  // note that no degenerate triangle is constructed in patch
-  std::vector<Point_3> polyline_collinear;
-  polyline_collinear.push_back(Point_3(1.,0.,0.));
-  polyline_collinear.push_back(Point_3(2.,0.,0.));
-  polyline_collinear.push_back(Point_3(3.,0.,0.));
-  polyline_collinear.push_back(Point_3(4.,0.,0.));
+  // note that no degenerate triangles are generated in the patch
+  std::vector<Point> polyline_collinear;
+  polyline_collinear.push_back(Point(1.,0.,0.));
+  polyline_collinear.push_back(Point(2.,0.,0.));
+  polyline_collinear.push_back(Point(3.,0.,0.));
+  polyline_collinear.push_back(Point(4.,0.,0.));
 
   std::vector<Triangle_int> patch_will_be_empty;
   CGAL::Polygon_mesh_processing::triangulate_hole_polyline(