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 8024278bc9a..8448b4bce52 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
@@ -1,19 +1,15 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/triangulate_hole.h>
+#include <CGAL/utility.h>
 
 #include <vector>
-#include <boost/tuple/tuple.hpp>
-#include <CGAL/utility.h>
+#include <iterator>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
 typedef Kernel::Point_3 Point_3;
 
-struct My_triangle {
-  int v0, v1, v2;
-  My_triangle(int v0, int v1, int v2) : v0(v0), v1(v1), v2(v2) { }
-};
-
-int main() {
+int main()
+{
   std::vector<Point_3> polyline;
   polyline.push_back(Point_3( 1.,0.,0.));
   polyline.push_back(Point_3( 0.,1.,0.));
@@ -22,28 +18,19 @@ int main() {
   // repeating first point (i.e. polyline.push_back(Point_3(1.,0.,0.)) ) is optional
 
   // any type, having Type(int, int, int) constructor available, can be used to hold output triangles
-  std::vector<boost::tuple<int, int, int> > patch_1;
-  std::vector<CGAL::Triple<int, int, int> > patch_2;
-  std::vector<My_triangle>                  patch_3;
+  typedef CGAL::Triple<int, int, int> Triangle_int;
+  std::vector<Triangle_int> patch;
+  patch.reserve(polyline.size() -2); // there will be exactly n-2 triangles in the patch
 
-  patch_1.reserve(polyline.size() -2); // there will be exactly n-2 triangles in the patch
   CGAL::Polygon_mesh_processing::triangulate_hole_polyline(
-    polyline, back_inserter(patch_1));
-  CGAL::Polygon_mesh_processing::triangulate_hole_polyline(
-    polyline, back_inserter(patch_2));
-  CGAL::Polygon_mesh_processing::triangulate_hole_polyline(
-    polyline, back_inserter(patch_3));
+          polyline,
+          std::back_inserter(patch));
 
-  for(std::size_t i = 0; i < patch_1.size(); ++i) {
-    std::cout << "Triangle " << i << ": " << patch_1[i].get<0>() << " " 
-              << patch_1[i].get<1>() << " " << patch_1[i].get<2>() << std::endl;
-
-    CGAL_assertion(patch_1[i].get<0>() == patch_2[i].first
-                && patch_2[i].first  == patch_3[i].v0);
-    CGAL_assertion(patch_1[i].get<1>() == patch_2[i].second
-                && patch_2[i].second == patch_3[i].v1);
-    CGAL_assertion(patch_1[i].get<2>() == patch_2[i].third
-                && patch_2[i].third == patch_3[i].v2);
+  for(std::size_t i = 0; i < patch.size(); ++i)
+  {
+    std::cout << "Triangle " << i << ": "
+      << patch[i].first << " " << patch[i].second << " " << patch[i].third
+      << std::endl;
   }
 
   // note that no degenerate triangle is constructed in patch
@@ -52,9 +39,12 @@ int main() {
   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.));
-  std::vector<My_triangle> patch_will_be_empty;
+
+  std::vector<Triangle_int> patch_will_be_empty;
   CGAL::Polygon_mesh_processing::triangulate_hole_polyline(
-    polyline_collinear,
-    back_inserter(patch_will_be_empty));
+          polyline_collinear,
+          back_inserter(patch_will_be_empty));
   CGAL_assertion(patch_will_be_empty.empty());
+
+  return 0;
 }