From 847c23a15eccb01f84a3efdf3f534a327dcbcf1e Mon Sep 17 00:00:00 2001
From: Sylvain Pion <Sylvain.Pion@sophia.inria.fr>
Date: Sat, 10 Mar 2007 16:17:17 +0000
Subject: [PATCH] Removing leading and trailing empty lines from all example
 files. Using the following Perl script:
 ----------------------------------------------------- #!/usr/bin/perl

local($/) = undef;
my $text = <>;

$text =~ s/\A\n+//mg;
$text =~ s/\n+\Z/\n/mg;

print "$text";
-----------------------------------------------------
---
 .../examples/Alpha_shapes_2/alpha_shapes_2.cpp  |  1 -
 .../Alpha_shapes_2/weighted_alpha_shapes_2.cpp  |  1 -
 .../examples/Alpha_shapes_3/alpha_shapes_3.cpp  |  2 --
 .../Apollonius_graph_2/ag2_exact_traits.cpp     |  3 ---
 .../ag2_exact_traits_sqrt.cpp                   |  1 -
 .../ag2_filtered_traits_no_hidden.cpp           |  3 ---
 .../Apollonius_graph_2/ag2_hierarchy.cpp        |  3 ---
 .../Approximate_min_ellipsoid_d/ellipsoid.cpp   |  1 -
 .../examples/Arrangement_2/Bezier_curves.cpp    |  1 -
 .../Arrangement_2/aggregated_insertion.cpp      |  1 -
 .../Arrangement_2/batched_point_location.cpp    |  1 -
 .../examples/Arrangement_2/circles.cpp          |  1 -
 .../examples/Arrangement_2/circular_arcs.cpp    |  1 -
 .../examples/Arrangement_2/curve_history.cpp    |  1 -
 .../Arrangement_2/dcel_extension_io.cpp         |  1 -
 .../examples/Arrangement_2/edge_insertion.cpp   |  1 -
 .../Arrangement_2/edge_manipulation.cpp         |  1 -
 .../edge_manipulation_curve_history.cpp         |  1 -
 .../examples/Arrangement_2/global_insertion.cpp |  1 -
 .../examples/Arrangement_2/global_removal.cpp   |  1 -
 .../Arrangement_2/incremental_insertion.cpp     |  1 -
 Arrangement_2/examples/Arrangement_2/io.cpp     |  1 -
 .../examples/Arrangement_2/io_curve_history.cpp |  1 -
 .../Arrangement_2/isolated_vertices.cpp         |  1 -
 .../examples/Arrangement_2/point_location.cpp   |  1 -
 .../Arrangement_2/predefined_kernel.cpp         |  1 -
 .../predefined_kernel_non_intersecting.cpp      |  1 -
 .../Arrangement_2/special_edge_insertion.cpp    |  1 -
 .../Arrangement_2/vertical_decomposition.cpp    |  1 -
 .../Arrangement_2/vertical_ray_shooting.cpp     |  1 -
 Benchmark/examples/Benchmark/check_syntax.cpp   |  1 -
 Benchmark/examples/Benchmark/polynomial.cpp     |  1 -
 .../examples/Box_intersection_d/minimal.cpp     |  1 -
 .../Box_intersection_d/minimal_self.cpp         |  1 -
 .../Circular_kernel_arrangement.cpp             |  1 -
 ...ircular_kernel_arrangement_Line_Circular.cpp |  1 -
 .../Circular_kernel_arrangement_Line_arc.cpp    |  1 -
 .../Circular_kernel_2/Exact_circular_kernel.cpp |  2 --
 .../Lazy_Circular_kernel_arrangement.cpp        |  1 -
 ...ircular_kernel_arrangement_Line_Circular.cpp |  1 -
 ...azy_Circular_kernel_arrangement_Line_arc.cpp |  1 -
 .../arrangement_random_circles.cpp              |  1 -
 .../arrangement_random_circles_segments.cpp     |  1 -
 .../examples/Circulator/circulator_prog1.cpp    |  1 -
 .../examples/Circulator/circulator_prog2.cpp    |  1 -
 .../examples/Circulator/circulator_prog3.cpp    |  1 -
 .../ch_example_from_cin_to_cout.cpp             |  2 --
 .../Convex_hull_2/ch_example_timing.cpp         |  1 -
 .../Convex_hull_2/ch_graham_anderson.cpp        |  1 -
 .../examples/Convex_hull_3/dynamic_hull_3.cpp   |  1 -
 .../Convex_hull_3/incremental_hull_3.cpp        |  1 -
 .../examples/Convex_hull_3/quickhull_3.cpp      |  1 -
 Core/examples/Core/delaunay.cpp                 |  1 -
 .../Cubical_gaussian_map_3/minksum_simple.cpp   |  1 -
 .../examples/Envelope_2/ex_envelope_circles.cpp |  1 -
 .../Filtered_kernel/Filtered_predicate.cpp      |  2 --
 .../examples/Generator/random_convex_set.cpp    |  1 -
 .../Generator/random_degenerate_point_set.cpp   |  1 -
 Generator/examples/Generator/random_grid.cpp    |  1 -
 Generator/examples/Generator/random_polygon.cpp |  2 --
 .../examples/Generator/random_polygon2.cpp      |  1 -
 .../examples/Generator/random_segments1.cpp     |  1 -
 .../examples/Generator/random_segments2.cpp     |  3 ---
 .../examples/HalfedgeDS/hds_prog_color.cpp      |  1 -
 .../examples/HalfedgeDS/hds_prog_compact.cpp    |  1 -
 .../examples/HalfedgeDS/hds_prog_compact2.cpp   |  1 -
 .../examples/HalfedgeDS/hds_prog_default.cpp    |  1 -
 .../HalfedgeDS/hds_prog_edge_iterator.cpp       |  1 -
 .../examples/HalfedgeDS/hds_prog_graph.cpp      |  1 -
 .../examples/HalfedgeDS/hds_prog_graph2.cpp     |  1 -
 .../HalfedgeDS/hds_prog_halfedge_iterator.cpp   |  1 -
 .../examples/HalfedgeDS/hds_prog_vector.cpp     |  1 -
 .../examples/Interval_skip_list/intervals.cpp   |  3 ---
 .../examples/Interval_skip_list/terrain.cpp     |  1 -
 Jet_fitting_3/examples/Jet_fitting_3/blind.cpp  |  1 -
 Kernel_23/examples/Kernel_23/MyKernel.cpp       |  1 -
 .../examples/Kernel_23/test_delaunay_2.cpp      |  1 -
 .../test_polyhedron_prog_incr_builder.cpp       |  1 -
 ...lyhedron_prog_incr_builder_own_archetype.cpp |  1 -
 .../examples/Kinetic_framework/listener.cpp     |  1 -
 .../largest_empty_rectangle.cpp                 |  1 -
 .../Matrix_search/all_furthest_neighbors_2.cpp  |  2 --
 .../Matrix_search/rectangular_p_center_2.cpp    |  2 --
 .../Matrix_search/sorted_matrix_search.cpp      |  2 --
 Mesh_2/examples/Mesh_2/conforming.cpp           |  1 -
 Mesh_2/examples/Mesh_2/mesh_class.cpp           |  1 -
 Mesh_2/examples/Mesh_2/mesh_global.cpp          |  1 -
 Mesh_2/examples/Mesh_2/mesh_with_seeds.cpp      |  1 -
 .../examples/Min_annulus_d/min_annulus_d.cpp    |  1 -
 .../Min_annulus_d/min_annulus_d_fast_exact.cpp  |  1 -
 .../examples/Min_circle_2/min_circle_2.cpp      |  1 -
 .../examples/Min_ellipse_2/min_ellipse_2.cpp    |  1 -
 .../minimum_enclosing_parallelogram_2.cpp       |  1 -
 .../minimum_enclosing_rectangle_2.cpp           |  2 --
 .../minimum_enclosing_strip_2.cpp               |  2 --
 .../examples/Min_sphere_d/min_sphere_d.cpp      |  2 --
 .../Min_sphere_of_spheres_d/benchmark.cpp       |  1 -
 .../min_sphere_of_spheres_d_2.cpp               |  1 -
 .../min_sphere_of_spheres_d_3.cpp               |  1 -
 .../min_sphere_of_spheres_d_d.cpp               |  1 -
 Nef_2/examples/Nef_2/construction.cpp           |  3 ---
 Nef_2/examples/Nef_2/polylines.cpp              |  2 --
 Nef_2/examples/Nef_2/simple_intersection.cpp    |  3 ---
 Nef_3/examples/Nef_3/complex_construction.cpp   |  1 -
 Nef_3/examples/Nef_3/construction.cpp           |  1 -
 Nef_3/examples/Nef_3/exploration_SM.cpp         |  1 -
 Nef_3/examples/Nef_3/extended_kernel.cpp        |  1 -
 Nef_3/examples/Nef_3/interface_polyhedron.cpp   |  1 -
 Nef_3/examples/Nef_3/nefIO.cpp                  |  1 -
 Nef_3/examples/Nef_3/point_location.cpp         |  2 --
 Nef_3/examples/Nef_3/point_set_operations.cpp   |  1 -
 Nef_3/examples/Nef_3/shell_exploration.cpp      |  1 -
 Nef_3/examples/Nef_3/simple.cpp                 |  1 -
 Nef_S2/examples/Nef_S2/construction.cpp         |  2 --
 Nef_S2/examples/Nef_S2/exploration.cpp          |  2 --
 Nef_S2/examples/Nef_S2/point_location.cpp       |  2 --
 PDB/examples/PDB/pdb_align.cpp                  |  1 -
 PDB/examples/PDB/pdb_align_points.cpp           |  1 -
 PDB/examples/PDB/pdb_distance.cpp               |  1 -
 PDB/examples/PDB/pdb_distances.cpp              |  3 ---
 .../Partition_2/approx_convex_partition_2.cpp   |  1 -
 .../greene_approx_convex_partition_2.cpp        |  1 -
 .../Partition_2/optimal_convex_partition_2.cpp  |  1 -
 .../Partition_2/y_monotone_partition_2.cpp      |  1 -
 .../examples/Point_set_2/nearest_neighbor.cpp   |  1 -
 .../examples/Point_set_2/range_search.cpp       |  1 -
 Polygon/examples/Polygon/Example.cpp            |  2 --
 Polygon/examples/Polygon/Polygon.cpp            |  2 --
 Polygon/examples/Polygon/polygon_algorithms.cpp |  2 --
 .../Polyhedron/polyhedron_prog_cube.cpp         |  1 -
 .../Polyhedron/polyhedron_prog_incr_builder.cpp |  1 -
 .../Polyhedron/polyhedron_prog_normals.cpp      |  1 -
 .../examples/Polyhedron/polyhedron_prog_off.cpp |  1 -
 .../Polyhedron/polyhedron_prog_planes.cpp       |  1 -
 .../Polyhedron/polyhedron_prog_simple.cpp       |  1 -
 .../Polyhedron/polyhedron_prog_subdiv.cpp       |  1 -
 .../polyhedron_prog_subdiv_with_boundary.cpp    |  1 -
 .../Polyhedron/polyhedron_prog_tetra.cpp        |  1 -
 .../Polyhedron/polyhedron_prog_traits.cpp       |  1 -
 .../Polyhedron/polyhedron_prog_vector.cpp       |  1 -
 Polyhedron_IO/examples/Polyhedron_IO/iv2off.cpp |  1 -
 Polyhedron_IO/examples/Polyhedron_IO/off2iv.cpp |  1 -
 .../examples/Polyhedron_IO/off2off.cpp          |  1 -
 .../examples/Polyhedron_IO/off2stl.cpp          |  1 -
 .../examples/Polyhedron_IO/off2vrml.cpp         |  1 -
 .../examples/Polyhedron_IO/off2wav.cpp          |  1 -
 .../examples/Polyhedron_IO/off_bbox.cpp         |  1 -
 .../examples/Polyhedron_IO/off_glue.cpp         |  2 --
 .../examples/Polyhedron_IO/off_transform.cpp    |  1 -
 .../examples/Polyhedron_IO/polyhedron2vrml.cpp  |  1 -
 .../examples/Polyhedron_IO/polyhedron_copy.cpp  |  1 -
 .../Polytope_distance_d/polytope_distance_d.cpp |  1 -
 .../polytope_distance_d_fast_exact.cpp          |  1 -
 .../test_reconstruction_from_slices.cpp         |  2 --
 .../test_triangulation_points_in_polylines.cpp  |  2 --
 .../test_triangulation_points_in_slices.cpp     |  2 --
 Ridges_3/examples/Ridges_3/PolyhedralSurf.cpp   |  1 -
 Ridges_3/examples/Ridges_3/blind.cpp            |  2 --
 .../STL_Extension/in_place_list_prog.cpp        |  1 -
 .../min_element_if_example_noheader.cpp         |  1 -
 .../min_max_element_example_noheader.cpp        |  1 -
 .../examples/RangeSegmentTrees/range_tree_1.cpp |  3 ---
 .../examples/RangeSegmentTrees/range_tree_2.cpp |  3 ---
 .../examples/RangeSegmentTrees/range_tree_3.cpp | 17 -----------------
 .../examples/RangeSegmentTrees/range_tree_4.cpp |  3 ---
 .../RangeSegmentTrees/range_tree_map_2.cpp      |  3 ---
 .../RangeSegmentTrees/range_tree_set_2.cpp      |  3 ---
 .../RangeSegmentTrees/segment_tree_1.cpp        |  3 ---
 .../RangeSegmentTrees/segment_tree_2.cpp        |  1 -
 .../RangeSegmentTrees/segment_tree_3.cpp        |  3 ---
 .../RangeSegmentTrees/segment_tree_4.cpp        |  3 ---
 .../RangeSegmentTrees/segment_tree_map_2.cpp    |  3 ---
 .../RangeSegmentTrees/segment_tree_set_2.cpp    |  3 ---
 .../RangeSegmentTrees/segment_tree_set_3.cpp    |  3 ---
 .../sdg-filtered-traits.cpp                     |  2 --
 .../Spatial_searching/circular_query.cpp        |  2 --
 .../Spatial_searching/distance_browsing.cpp     | 16 ----------------
 .../general_neighbor_searching.cpp              |  1 -
 .../Spatial_searching/iso_rectangle_2_query.cpp |  3 ---
 .../nearest_neighbor_searching.cpp              |  1 -
 .../searching_with_circular_query.cpp           |  2 --
 .../using_fair_splitting_rule.cpp               |  1 -
 .../weighted_Minkowski_distance.cpp             |  1 -
 .../examples/Spatial_sorting/sort_indices.cpp   |  1 -
 .../CatmullClark_subdivision.cpp                |  1 -
 .../Customized_subdivision.cpp                  |  1 -
 .../DooSabin_subdivision.cpp                    |  1 -
 .../Subdivision_method_3/Loop_subdivision.cpp   |  1 -
 .../examples/Triangulation_2/adding_handles.cpp |  1 -
 .../examples/Triangulation_2/colored_face.cpp   |  1 -
 .../examples/Triangulation_2/constrained.cpp    |  2 --
 .../constrained_hierarchy_plus.cpp              |  1 -
 .../Triangulation_2/constrained_plus.cpp        |  1 -
 .../examples/Triangulation_2/hierarchy.cpp      |  1 -
 .../examples/Triangulation_2/regular.cpp        |  1 -
 .../examples/Triangulation_2/terrain.cpp        |  2 --
 .../Triangulation_2/triangulation_prog1.cpp     |  1 -
 .../examples/Triangulation_2/voronoi.cpp        |  2 --
 .../examples/Triangulation_3/adding_handles.cpp |  1 -
 .../examples/Triangulation_3/color.cpp          |  1 -
 .../examples/Triangulation_3/find_conflicts.cpp |  1 -
 .../examples/Triangulation_3/hierarchy.cpp      |  1 -
 .../Triangulation_3/linking_2d_and_3d.cpp       |  1 -
 .../examples/Triangulation_3/regular.cpp        |  1 -
 .../examples/Triangulation_3/tds.cpp            |  1 -
 Width_3/examples/Width_3/width_simplex.cpp      |  5 -----
 206 files changed, 311 deletions(-)

diff --git a/Alpha_shapes_2/examples/Alpha_shapes_2/alpha_shapes_2.cpp b/Alpha_shapes_2/examples/Alpha_shapes_2/alpha_shapes_2.cpp
index 67f7240c5be..871b5f1af9b 100644
--- a/Alpha_shapes_2/examples/Alpha_shapes_2/alpha_shapes_2.cpp
+++ b/Alpha_shapes_2/examples/Alpha_shapes_2/alpha_shapes_2.cpp
@@ -1,4 +1,3 @@
-
 /***********************************************************************
 
 Takes a list of points and returns a list of segments corresponding to the
diff --git a/Alpha_shapes_2/examples/Alpha_shapes_2/weighted_alpha_shapes_2.cpp b/Alpha_shapes_2/examples/Alpha_shapes_2/weighted_alpha_shapes_2.cpp
index 20f2525fab5..787b4dfc949 100644
--- a/Alpha_shapes_2/examples/Alpha_shapes_2/weighted_alpha_shapes_2.cpp
+++ b/Alpha_shapes_2/examples/Alpha_shapes_2/weighted_alpha_shapes_2.cpp
@@ -1,4 +1,3 @@
-
 /***********************************************************************
 
 Takes a list of points and returns a list of segments corresponding to
diff --git a/Alpha_shapes_3/examples/Alpha_shapes_3/alpha_shapes_3.cpp b/Alpha_shapes_3/examples/Alpha_shapes_3/alpha_shapes_3.cpp
index 8d3f0394910..3d2e6451f6f 100644
--- a/Alpha_shapes_3/examples/Alpha_shapes_3/alpha_shapes_3.cpp
+++ b/Alpha_shapes_3/examples/Alpha_shapes_3/alpha_shapes_3.cpp
@@ -44,5 +44,3 @@ int main()
   assert(as.number_of_solid_components() == 1);
   return 0;
 }
-
-
diff --git a/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_exact_traits.cpp b/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_exact_traits.cpp
index 02237f8ae1a..61f75d16259 100644
--- a/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_exact_traits.cpp
+++ b/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_exact_traits.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 
 // standard includes
@@ -48,5 +47,3 @@ int main()
 
   return 0;
 }
-
-
diff --git a/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_exact_traits_sqrt.cpp b/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_exact_traits_sqrt.cpp
index 4e3eac9e094..4b7d9278e34 100644
--- a/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_exact_traits_sqrt.cpp
+++ b/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_exact_traits_sqrt.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 
 // standard includes
diff --git a/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_filtered_traits_no_hidden.cpp b/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_filtered_traits_no_hidden.cpp
index dc66e9c0ac2..d1684d9dc6f 100644
--- a/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_filtered_traits_no_hidden.cpp
+++ b/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_filtered_traits_no_hidden.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 
 // standard includes
@@ -62,5 +61,3 @@ int main()
 
   return 0;
 }
-
-
diff --git a/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_hierarchy.cpp b/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_hierarchy.cpp
index 328d2f33de9..dee41c8fa3d 100644
--- a/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_hierarchy.cpp
+++ b/Apollonius_graph_2/examples/Apollonius_graph_2/ag2_hierarchy.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 
 // standard includes
@@ -62,5 +61,3 @@ int main()
 
   return 0;
 }
-
-
diff --git a/Approximate_min_ellipsoid_d/examples/Approximate_min_ellipsoid_d/ellipsoid.cpp b/Approximate_min_ellipsoid_d/examples/Approximate_min_ellipsoid_d/ellipsoid.cpp
index dec9b3a1ae8..422e61d0268 100644
--- a/Approximate_min_ellipsoid_d/examples/Approximate_min_ellipsoid_d/ellipsoid.cpp
+++ b/Approximate_min_ellipsoid_d/examples/Approximate_min_ellipsoid_d/ellipsoid.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian_d.h>
 #include <CGAL/MP_Float.h>
 #include <CGAL/point_generators_d.h>
diff --git a/Arrangement_2/examples/Arrangement_2/Bezier_curves.cpp b/Arrangement_2/examples/Arrangement_2/Bezier_curves.cpp
index b7e451e58cf..20fed8312eb 100644
--- a/Arrangement_2/examples/Arrangement_2/Bezier_curves.cpp
+++ b/Arrangement_2/examples/Arrangement_2/Bezier_curves.cpp
@@ -78,4 +78,3 @@ int main (int argc, char **argv)
 }
 
 #endif
-
diff --git a/Arrangement_2/examples/Arrangement_2/aggregated_insertion.cpp b/Arrangement_2/examples/Arrangement_2/aggregated_insertion.cpp
index de3444ddfa0..e7002e20ed9 100644
--- a/Arrangement_2/examples/Arrangement_2/aggregated_insertion.cpp
+++ b/Arrangement_2/examples/Arrangement_2/aggregated_insertion.cpp
@@ -36,4 +36,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/batched_point_location.cpp b/Arrangement_2/examples/Arrangement_2/batched_point_location.cpp
index 71e149f7308..6db500115b6 100644
--- a/Arrangement_2/examples/Arrangement_2/batched_point_location.cpp
+++ b/Arrangement_2/examples/Arrangement_2/batched_point_location.cpp
@@ -72,4 +72,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/circles.cpp b/Arrangement_2/examples/Arrangement_2/circles.cpp
index 460b602736e..c591836b10f 100644
--- a/Arrangement_2/examples/Arrangement_2/circles.cpp
+++ b/Arrangement_2/examples/Arrangement_2/circles.cpp
@@ -61,4 +61,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/circular_arcs.cpp b/Arrangement_2/examples/Arrangement_2/circular_arcs.cpp
index 36cac2db36c..330358c0e48 100644
--- a/Arrangement_2/examples/Arrangement_2/circular_arcs.cpp
+++ b/Arrangement_2/examples/Arrangement_2/circular_arcs.cpp
@@ -91,4 +91,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/curve_history.cpp b/Arrangement_2/examples/Arrangement_2/curve_history.cpp
index 2ae4254e35a..2db1cb4de4b 100644
--- a/Arrangement_2/examples/Arrangement_2/curve_history.cpp
+++ b/Arrangement_2/examples/Arrangement_2/curve_history.cpp
@@ -77,4 +77,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/dcel_extension_io.cpp b/Arrangement_2/examples/Arrangement_2/dcel_extension_io.cpp
index 156d148de56..398b3d42f74 100644
--- a/Arrangement_2/examples/Arrangement_2/dcel_extension_io.cpp
+++ b/Arrangement_2/examples/Arrangement_2/dcel_extension_io.cpp
@@ -135,4 +135,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/edge_insertion.cpp b/Arrangement_2/examples/Arrangement_2/edge_insertion.cpp
index 39100c980a7..4a24b41e9ec 100644
--- a/Arrangement_2/examples/Arrangement_2/edge_insertion.cpp
+++ b/Arrangement_2/examples/Arrangement_2/edge_insertion.cpp
@@ -40,4 +40,3 @@ int main ()
   print_arrangement (arr);
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/edge_manipulation.cpp b/Arrangement_2/examples/Arrangement_2/edge_manipulation.cpp
index 0e0283949ef..9ec5e1708d0 100644
--- a/Arrangement_2/examples/Arrangement_2/edge_manipulation.cpp
+++ b/Arrangement_2/examples/Arrangement_2/edge_manipulation.cpp
@@ -82,4 +82,3 @@ int main ()
   print_arrangement (arr);
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/edge_manipulation_curve_history.cpp b/Arrangement_2/examples/Arrangement_2/edge_manipulation_curve_history.cpp
index 8faf08f9fb0..b6e28b4cec9 100644
--- a/Arrangement_2/examples/Arrangement_2/edge_manipulation_curve_history.cpp
+++ b/Arrangement_2/examples/Arrangement_2/edge_manipulation_curve_history.cpp
@@ -85,4 +85,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/global_insertion.cpp b/Arrangement_2/examples/Arrangement_2/global_insertion.cpp
index 622ce7fd62b..de9920358ce 100644
--- a/Arrangement_2/examples/Arrangement_2/global_insertion.cpp
+++ b/Arrangement_2/examples/Arrangement_2/global_insertion.cpp
@@ -58,4 +58,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/global_removal.cpp b/Arrangement_2/examples/Arrangement_2/global_removal.cpp
index db3d9c7688a..441b7572cbb 100644
--- a/Arrangement_2/examples/Arrangement_2/global_removal.cpp
+++ b/Arrangement_2/examples/Arrangement_2/global_removal.cpp
@@ -50,4 +50,3 @@ int main ()
   print_arrangement (arr);
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/incremental_insertion.cpp b/Arrangement_2/examples/Arrangement_2/incremental_insertion.cpp
index d79a7c1f0cd..e07abb5333f 100644
--- a/Arrangement_2/examples/Arrangement_2/incremental_insertion.cpp
+++ b/Arrangement_2/examples/Arrangement_2/incremental_insertion.cpp
@@ -55,4 +55,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/io.cpp b/Arrangement_2/examples/Arrangement_2/io.cpp
index 8ff0f240a77..da53054baff 100644
--- a/Arrangement_2/examples/Arrangement_2/io.cpp
+++ b/Arrangement_2/examples/Arrangement_2/io.cpp
@@ -46,4 +46,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/io_curve_history.cpp b/Arrangement_2/examples/Arrangement_2/io_curve_history.cpp
index ecbe11c850f..b15bf43477a 100644
--- a/Arrangement_2/examples/Arrangement_2/io_curve_history.cpp
+++ b/Arrangement_2/examples/Arrangement_2/io_curve_history.cpp
@@ -55,4 +55,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/isolated_vertices.cpp b/Arrangement_2/examples/Arrangement_2/isolated_vertices.cpp
index 6288b495439..beee63e1966 100644
--- a/Arrangement_2/examples/Arrangement_2/isolated_vertices.cpp
+++ b/Arrangement_2/examples/Arrangement_2/isolated_vertices.cpp
@@ -60,4 +60,3 @@ int main ()
   print_arrangement (arr);
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/point_location.cpp b/Arrangement_2/examples/Arrangement_2/point_location.cpp
index e710428ea5a..f4f82d79c70 100644
--- a/Arrangement_2/examples/Arrangement_2/point_location.cpp
+++ b/Arrangement_2/examples/Arrangement_2/point_location.cpp
@@ -48,4 +48,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/predefined_kernel.cpp b/Arrangement_2/examples/Arrangement_2/predefined_kernel.cpp
index 3864c123e6d..67c68eb2261 100644
--- a/Arrangement_2/examples/Arrangement_2/predefined_kernel.cpp
+++ b/Arrangement_2/examples/Arrangement_2/predefined_kernel.cpp
@@ -83,4 +83,3 @@ int main (int argc, char **argv)
 
   return 0;
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/predefined_kernel_non_intersecting.cpp b/Arrangement_2/examples/Arrangement_2/predefined_kernel_non_intersecting.cpp
index 2d6dac294e9..1038983ecc0 100644
--- a/Arrangement_2/examples/Arrangement_2/predefined_kernel_non_intersecting.cpp
+++ b/Arrangement_2/examples/Arrangement_2/predefined_kernel_non_intersecting.cpp
@@ -80,4 +80,3 @@ int main (int argc, char **argv)
 
   return 0;
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/special_edge_insertion.cpp b/Arrangement_2/examples/Arrangement_2/special_edge_insertion.cpp
index cdf8e289880..989b01e7044 100644
--- a/Arrangement_2/examples/Arrangement_2/special_edge_insertion.cpp
+++ b/Arrangement_2/examples/Arrangement_2/special_edge_insertion.cpp
@@ -44,4 +44,3 @@ int main ()
   print_arrangement (arr);
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/vertical_decomposition.cpp b/Arrangement_2/examples/Arrangement_2/vertical_decomposition.cpp
index 1fb6b8c97e2..1d96186d5a0 100644
--- a/Arrangement_2/examples/Arrangement_2/vertical_decomposition.cpp
+++ b/Arrangement_2/examples/Arrangement_2/vertical_decomposition.cpp
@@ -82,4 +82,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Arrangement_2/examples/Arrangement_2/vertical_ray_shooting.cpp b/Arrangement_2/examples/Arrangement_2/vertical_ray_shooting.cpp
index 38931a16c05..9b41bba8fc3 100644
--- a/Arrangement_2/examples/Arrangement_2/vertical_ray_shooting.cpp
+++ b/Arrangement_2/examples/Arrangement_2/vertical_ray_shooting.cpp
@@ -48,4 +48,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Benchmark/examples/Benchmark/check_syntax.cpp b/Benchmark/examples/Benchmark/check_syntax.cpp
index 2a369d459b2..bb35d42674d 100644
--- a/Benchmark/examples/Benchmark/check_syntax.cpp
+++ b/Benchmark/examples/Benchmark/check_syntax.cpp
@@ -83,4 +83,3 @@ int main( int argc, char* argv[] ) {
     }
     return exit_status;
 }
-
diff --git a/Benchmark/examples/Benchmark/polynomial.cpp b/Benchmark/examples/Benchmark/polynomial.cpp
index b6cb091c914..5da5955159d 100644
--- a/Benchmark/examples/Benchmark/polynomial.cpp
+++ b/Benchmark/examples/Benchmark/polynomial.cpp
@@ -105,4 +105,3 @@ int main( int argc, char* argv[] ) {
     }
     return exit_status;
 }
-
diff --git a/Box_intersection_d/examples/Box_intersection_d/minimal.cpp b/Box_intersection_d/examples/Box_intersection_d/minimal.cpp
index b953b4d2054..e9bfa802424 100644
--- a/Box_intersection_d/examples/Box_intersection_d/minimal.cpp
+++ b/Box_intersection_d/examples/Box_intersection_d/minimal.cpp
@@ -18,4 +18,3 @@ int main() {
     CGAL::box_intersection_d( boxes, boxes+9, query, query+2, callback);
     return 0;
 }
-
diff --git a/Box_intersection_d/examples/Box_intersection_d/minimal_self.cpp b/Box_intersection_d/examples/Box_intersection_d/minimal_self.cpp
index 96970ad85c2..6af86d878da 100644
--- a/Box_intersection_d/examples/Box_intersection_d/minimal_self.cpp
+++ b/Box_intersection_d/examples/Box_intersection_d/minimal_self.cpp
@@ -18,4 +18,3 @@ int main() {
     CGAL::box_self_intersection_d( boxes, boxes+9, callback);
     return 0;
 }
-
diff --git a/Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement.cpp b/Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement.cpp
index 9b86bab834a..4550059ab21 100644
--- a/Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement.cpp
+++ b/Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement.cpp
@@ -53,4 +53,3 @@ int main(){
 
   return 0;
 };
-
diff --git a/Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement_Line_Circular.cpp b/Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement_Line_Circular.cpp
index b4ad713ec24..69a1144c61c 100644
--- a/Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement_Line_Circular.cpp
+++ b/Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement_Line_Circular.cpp
@@ -82,4 +82,3 @@ int main(){
 
   return 0;
 };
-
diff --git a/Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement_Line_arc.cpp b/Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement_Line_arc.cpp
index 631227c0c04..a0bb27c840b 100644
--- a/Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement_Line_arc.cpp
+++ b/Circular_kernel_2/examples/Circular_kernel_2/Circular_kernel_arrangement_Line_arc.cpp
@@ -76,4 +76,3 @@ int main(){
   }
   return 0;
 };
-
diff --git a/Circular_kernel_2/examples/Circular_kernel_2/Exact_circular_kernel.cpp b/Circular_kernel_2/examples/Circular_kernel_2/Exact_circular_kernel.cpp
index e6bfbaee244..4ba891ef46f 100644
--- a/Circular_kernel_2/examples/Circular_kernel_2/Exact_circular_kernel.cpp
+++ b/Circular_kernel_2/examples/Circular_kernel_2/Exact_circular_kernel.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <CGAL/Random.h>
 #include <CGAL/point_generators_2.h>
@@ -65,4 +64,3 @@ int main(){
 
   return 0;
 };
-
diff --git a/Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement.cpp b/Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement.cpp
index 0f173ced979..a7e3e559465 100644
--- a/Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement.cpp
+++ b/Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement.cpp
@@ -116,4 +116,3 @@ std::cout<<"Exact Circular_k ="<<(t4-t3)<<std::endl;
 
   return 0;
 };
-
diff --git a/Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement_Line_Circular.cpp b/Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement_Line_Circular.cpp
index bb8343d47d5..ae9d14c8b94 100644
--- a/Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement_Line_Circular.cpp
+++ b/Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement_Line_Circular.cpp
@@ -180,4 +180,3 @@ int main(){
 
   return 0;
 };
-
diff --git a/Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement_Line_arc.cpp b/Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement_Line_arc.cpp
index 621e3e4522f..9a5594a481d 100644
--- a/Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement_Line_arc.cpp
+++ b/Circular_kernel_2/examples/Circular_kernel_2/Lazy_Circular_kernel_arrangement_Line_arc.cpp
@@ -140,4 +140,3 @@ int main(){
  // }
   return 0;
 };
-
diff --git a/Circular_kernel_2/examples/Circular_kernel_2/arrangement_random_circles.cpp b/Circular_kernel_2/examples/Circular_kernel_2/arrangement_random_circles.cpp
index bfc611e0852..ca3491ca09b 100644
--- a/Circular_kernel_2/examples/Circular_kernel_2/arrangement_random_circles.cpp
+++ b/Circular_kernel_2/examples/Circular_kernel_2/arrangement_random_circles.cpp
@@ -48,4 +48,3 @@ int main(){
 
   return 0;
 };
-
diff --git a/Circular_kernel_2/examples/Circular_kernel_2/arrangement_random_circles_segments.cpp b/Circular_kernel_2/examples/Circular_kernel_2/arrangement_random_circles_segments.cpp
index ce18e117d25..5e8ea0c4c47 100644
--- a/Circular_kernel_2/examples/Circular_kernel_2/arrangement_random_circles_segments.cpp
+++ b/Circular_kernel_2/examples/Circular_kernel_2/arrangement_random_circles_segments.cpp
@@ -68,4 +68,3 @@ int main(){
 
   return 0;
 };
-
diff --git a/Circulator/examples/Circulator/circulator_prog1.cpp b/Circulator/examples/Circulator/circulator_prog1.cpp
index 2bbfa630da1..7079724789b 100644
--- a/Circulator/examples/Circulator/circulator_prog1.cpp
+++ b/Circulator/examples/Circulator/circulator_prog1.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <cassert>
 #include <vector>
diff --git a/Circulator/examples/Circulator/circulator_prog2.cpp b/Circulator/examples/Circulator/circulator_prog2.cpp
index 9fe5c5ed362..5991b233560 100644
--- a/Circulator/examples/Circulator/circulator_prog2.cpp
+++ b/Circulator/examples/Circulator/circulator_prog2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <cassert>
 #include <vector>
diff --git a/Circulator/examples/Circulator/circulator_prog3.cpp b/Circulator/examples/Circulator/circulator_prog3.cpp
index e76afa90ac0..3a940981019 100644
--- a/Circulator/examples/Circulator/circulator_prog3.cpp
+++ b/Circulator/examples/Circulator/circulator_prog3.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <cassert>
 #include <list>
diff --git a/Convex_hull_2/examples/Convex_hull_2/ch_example_from_cin_to_cout.cpp b/Convex_hull_2/examples/Convex_hull_2/ch_example_from_cin_to_cout.cpp
index ece5168bb01..2ebce7fd626 100644
--- a/Convex_hull_2/examples/Convex_hull_2/ch_example_from_cin_to_cout.cpp
+++ b/Convex_hull_2/examples/Convex_hull_2/ch_example_from_cin_to_cout.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/ch_graham_andrew.h>
 
@@ -14,4 +13,3 @@ int main()
   CGAL::ch_graham_andrew( in_start, in_end, out );
   return 0;
 }
-
diff --git a/Convex_hull_2/examples/Convex_hull_2/ch_example_timing.cpp b/Convex_hull_2/examples/Convex_hull_2/ch_example_timing.cpp
index eddf5ec12d0..349dd25fff6 100644
--- a/Convex_hull_2/examples/Convex_hull_2/ch_example_timing.cpp
+++ b/Convex_hull_2/examples/Convex_hull_2/ch_example_timing.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/convex_hull_traits_2.h>
 
diff --git a/Convex_hull_2/examples/Convex_hull_2/ch_graham_anderson.cpp b/Convex_hull_2/examples/Convex_hull_2/ch_graham_anderson.cpp
index c3d3b26be66..023a5154909 100644
--- a/Convex_hull_2/examples/Convex_hull_2/ch_graham_anderson.cpp
+++ b/Convex_hull_2/examples/Convex_hull_2/ch_graham_anderson.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/ch_graham_andrew.h>
 #include <CGAL/functional.h>
diff --git a/Convex_hull_3/examples/Convex_hull_3/dynamic_hull_3.cpp b/Convex_hull_3/examples/Convex_hull_3/dynamic_hull_3.cpp
index c7f32d9a305..5134f399a33 100644
--- a/Convex_hull_3/examples/Convex_hull_3/dynamic_hull_3.cpp
+++ b/Convex_hull_3/examples/Convex_hull_3/dynamic_hull_3.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Filtered_kernel.h>
 #include <CGAL/point_generators_3.h>
diff --git a/Convex_hull_3/examples/Convex_hull_3/incremental_hull_3.cpp b/Convex_hull_3/examples/Convex_hull_3/incremental_hull_3.cpp
index d7f8706880f..0b278eced73 100644
--- a/Convex_hull_3/examples/Convex_hull_3/incremental_hull_3.cpp
+++ b/Convex_hull_3/examples/Convex_hull_3/incremental_hull_3.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Homogeneous.h>
 #include <CGAL/point_generators_3.h>
 #include <CGAL/copy_n.h>
diff --git a/Convex_hull_3/examples/Convex_hull_3/quickhull_3.cpp b/Convex_hull_3/examples/Convex_hull_3/quickhull_3.cpp
index 1eb1dda9b21..3763dc274a6 100644
--- a/Convex_hull_3/examples/Convex_hull_3/quickhull_3.cpp
+++ b/Convex_hull_3/examples/Convex_hull_3/quickhull_3.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Homogeneous.h>
 #include <CGAL/point_generators_3.h>
 #include <CGAL/copy_n.h>
diff --git a/Core/examples/Core/delaunay.cpp b/Core/examples/Core/delaunay.cpp
index 1c812c87262..3ff80b906a1 100644
--- a/Core/examples/Core/delaunay.cpp
+++ b/Core/examples/Core/delaunay.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 
 #ifdef CGAL_USE_CORE
diff --git a/Cubical_gaussian_map_3/examples/Cubical_gaussian_map_3/minksum_simple.cpp b/Cubical_gaussian_map_3/examples/Cubical_gaussian_map_3/minksum_simple.cpp
index 08a455dde53..212ba811b5e 100644
--- a/Cubical_gaussian_map_3/examples/Cubical_gaussian_map_3/minksum_simple.cpp
+++ b/Cubical_gaussian_map_3/examples/Cubical_gaussian_map_3/minksum_simple.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Gmpq.h>
 #include <CGAL/Polyhedral_cgm_polyhedron_3.h>
diff --git a/Envelope_2/examples/Envelope_2/ex_envelope_circles.cpp b/Envelope_2/examples/Envelope_2/ex_envelope_circles.cpp
index a0b6ae886d8..3fd9f7c2f56 100644
--- a/Envelope_2/examples/Envelope_2/ex_envelope_circles.cpp
+++ b/Envelope_2/examples/Envelope_2/ex_envelope_circles.cpp
@@ -75,4 +75,3 @@ int main ()
 
   return (0);
 }
-
diff --git a/Filtered_kernel/examples/Filtered_kernel/Filtered_predicate.cpp b/Filtered_kernel/examples/Filtered_kernel/Filtered_predicate.cpp
index ec937309d34..861b083876d 100644
--- a/Filtered_kernel/examples/Filtered_kernel/Filtered_predicate.cpp
+++ b/Filtered_kernel/examples/Filtered_kernel/Filtered_predicate.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Filtered_predicate.h>
 #include <CGAL/MP_Float.h>
@@ -41,4 +40,3 @@ int main()
   orientation(p, q, r);
   return 0;
 }
-
diff --git a/Generator/examples/Generator/random_convex_set.cpp b/Generator/examples/Generator/random_convex_set.cpp
index e1dc125af59..73fbfe10b0e 100644
--- a/Generator/examples/Generator/random_convex_set.cpp
+++ b/Generator/examples/Generator/random_convex_set.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/random_convex_set_2.h>
diff --git a/Generator/examples/Generator/random_degenerate_point_set.cpp b/Generator/examples/Generator/random_degenerate_point_set.cpp
index bafea891ac4..3870e89cb25 100644
--- a/Generator/examples/Generator/random_degenerate_point_set.cpp
+++ b/Generator/examples/Generator/random_degenerate_point_set.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <cassert>
 #include <vector>
diff --git a/Generator/examples/Generator/random_grid.cpp b/Generator/examples/Generator/random_grid.cpp
index 1a6d9680733..ba3556ef513 100644
--- a/Generator/examples/Generator/random_grid.cpp
+++ b/Generator/examples/Generator/random_grid.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <cassert>
 #include <vector>
diff --git a/Generator/examples/Generator/random_polygon.cpp b/Generator/examples/Generator/random_polygon.cpp
index 7b3261df29a..bf26ddf8f88 100644
--- a/Generator/examples/Generator/random_polygon.cpp
+++ b/Generator/examples/Generator/random_polygon.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
@@ -55,4 +54,3 @@ int main( )
    std::cout << polygon << std::endl;
    return 0;
 }
-
diff --git a/Generator/examples/Generator/random_polygon2.cpp b/Generator/examples/Generator/random_polygon2.cpp
index 106c0f3bd82..9b25b44bcd3 100644
--- a/Generator/examples/Generator/random_polygon2.cpp
+++ b/Generator/examples/Generator/random_polygon2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/random_polygon_2.h>
diff --git a/Generator/examples/Generator/random_segments1.cpp b/Generator/examples/Generator/random_segments1.cpp
index 2e1acf25e68..d050bc5cdd3 100644
--- a/Generator/examples/Generator/random_segments1.cpp
+++ b/Generator/examples/Generator/random_segments1.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <cassert>
 #include <vector>
diff --git a/Generator/examples/Generator/random_segments2.cpp b/Generator/examples/Generator/random_segments2.cpp
index c5279d06701..5d9f9bfb752 100644
--- a/Generator/examples/Generator/random_segments2.cpp
+++ b/Generator/examples/Generator/random_segments2.cpp
@@ -1,4 +1,3 @@
-
 // CGAL example program for the generic segment generator
 // using precomputed point locations.
 
@@ -55,5 +54,3 @@ int main() {
     }
     return 0;
 }
-
-
diff --git a/HalfedgeDS/examples/HalfedgeDS/hds_prog_color.cpp b/HalfedgeDS/examples/HalfedgeDS/hds_prog_color.cpp
index fd6b18dafce..87f415c4881 100644
--- a/HalfedgeDS/examples/HalfedgeDS/hds_prog_color.cpp
+++ b/HalfedgeDS/examples/HalfedgeDS/hds_prog_color.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_items_2.h>
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/IO/Color.h>
diff --git a/HalfedgeDS/examples/HalfedgeDS/hds_prog_compact.cpp b/HalfedgeDS/examples/HalfedgeDS/hds_prog_compact.cpp
index 6d982232ea3..5d11393031b 100644
--- a/HalfedgeDS/examples/HalfedgeDS/hds_prog_compact.cpp
+++ b/HalfedgeDS/examples/HalfedgeDS/hds_prog_compact.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_items_2.h>
 #include <CGAL/HalfedgeDS_vector.h>
 #include <CGAL/HalfedgeDS_decorator.h>
diff --git a/HalfedgeDS/examples/HalfedgeDS/hds_prog_compact2.cpp b/HalfedgeDS/examples/HalfedgeDS/hds_prog_compact2.cpp
index d022cb6339b..892f5eb5d0b 100644
--- a/HalfedgeDS/examples/HalfedgeDS/hds_prog_compact2.cpp
+++ b/HalfedgeDS/examples/HalfedgeDS/hds_prog_compact2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_items_2.h>
 #include <CGAL/HalfedgeDS_list.h>
 #include <CGAL/HalfedgeDS_decorator.h>
diff --git a/HalfedgeDS/examples/HalfedgeDS/hds_prog_default.cpp b/HalfedgeDS/examples/HalfedgeDS/hds_prog_default.cpp
index b5c1437c753..7fc3427cf97 100644
--- a/HalfedgeDS/examples/HalfedgeDS/hds_prog_default.cpp
+++ b/HalfedgeDS/examples/HalfedgeDS/hds_prog_default.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>
 
diff --git a/HalfedgeDS/examples/HalfedgeDS/hds_prog_edge_iterator.cpp b/HalfedgeDS/examples/HalfedgeDS/hds_prog_edge_iterator.cpp
index 692b6d79f30..edbc0a82dc6 100644
--- a/HalfedgeDS/examples/HalfedgeDS/hds_prog_edge_iterator.cpp
+++ b/HalfedgeDS/examples/HalfedgeDS/hds_prog_edge_iterator.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>
 #include <CGAL/N_step_adaptor.h>
diff --git a/HalfedgeDS/examples/HalfedgeDS/hds_prog_graph.cpp b/HalfedgeDS/examples/HalfedgeDS/hds_prog_graph.cpp
index 06595caca6f..92b27d5a47b 100644
--- a/HalfedgeDS/examples/HalfedgeDS/hds_prog_graph.cpp
+++ b/HalfedgeDS/examples/HalfedgeDS/hds_prog_graph.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_min_items.h>
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>
diff --git a/HalfedgeDS/examples/HalfedgeDS/hds_prog_graph2.cpp b/HalfedgeDS/examples/HalfedgeDS/hds_prog_graph2.cpp
index 186a94d9c91..c4895fcb8de 100644
--- a/HalfedgeDS/examples/HalfedgeDS/hds_prog_graph2.cpp
+++ b/HalfedgeDS/examples/HalfedgeDS/hds_prog_graph2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_min_items.h>
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>
diff --git a/HalfedgeDS/examples/HalfedgeDS/hds_prog_halfedge_iterator.cpp b/HalfedgeDS/examples/HalfedgeDS/hds_prog_halfedge_iterator.cpp
index 537a0db30f0..3b016824e79 100644
--- a/HalfedgeDS/examples/HalfedgeDS/hds_prog_halfedge_iterator.cpp
+++ b/HalfedgeDS/examples/HalfedgeDS/hds_prog_halfedge_iterator.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>
 
diff --git a/HalfedgeDS/examples/HalfedgeDS/hds_prog_vector.cpp b/HalfedgeDS/examples/HalfedgeDS/hds_prog_vector.cpp
index e92fb43e4ea..f27968ee208 100644
--- a/HalfedgeDS/examples/HalfedgeDS/hds_prog_vector.cpp
+++ b/HalfedgeDS/examples/HalfedgeDS/hds_prog_vector.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/HalfedgeDS_items_2.h>
 #include <CGAL/HalfedgeDS_vector.h>
 #include <CGAL/HalfedgeDS_decorator.h>
diff --git a/Interval_skip_list/examples/Interval_skip_list/intervals.cpp b/Interval_skip_list/examples/Interval_skip_list/intervals.cpp
index 0c69ba6922d..0a62f10d395 100644
--- a/Interval_skip_list/examples/Interval_skip_list/intervals.cpp
+++ b/Interval_skip_list/examples/Interval_skip_list/intervals.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Interval_skip_list.h>
 #include <CGAL/Interval_skip_list_interval.h>
 #include <vector>
@@ -39,5 +38,3 @@ int main()
   return 0;
 
 }
-
-
diff --git a/Interval_skip_list/examples/Interval_skip_list/terrain.cpp b/Interval_skip_list/examples/Interval_skip_list/terrain.cpp
index f4cc729e4a5..63cfb8590ac 100644
--- a/Interval_skip_list/examples/Interval_skip_list/terrain.cpp
+++ b/Interval_skip_list/examples/Interval_skip_list/terrain.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Delaunay_triangulation_2.h>
 #include <CGAL/Triangulation_euclidean_traits_xy_3.h>
diff --git a/Jet_fitting_3/examples/Jet_fitting_3/blind.cpp b/Jet_fitting_3/examples/Jet_fitting_3/blind.cpp
index c73bc581c68..c61f9edd036 100644
--- a/Jet_fitting_3/examples/Jet_fitting_3/blind.cpp
+++ b/Jet_fitting_3/examples/Jet_fitting_3/blind.cpp
@@ -289,4 +289,3 @@ int main(int argc, char *argv[])
   }
   return 0;
 }
-
diff --git a/Kernel_23/examples/Kernel_23/MyKernel.cpp b/Kernel_23/examples/Kernel_23/MyKernel.cpp
index ceb3373d820..ccb0ee00652 100644
--- a/Kernel_23/examples/Kernel_23/MyKernel.cpp
+++ b/Kernel_23/examples/Kernel_23/MyKernel.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <CGAL/Filtered_kernel.h>
 #include <CGAL/Delaunay_triangulation_2.h>
diff --git a/Kernel_23/examples/Kernel_23/test_delaunay_2.cpp b/Kernel_23/examples/Kernel_23/test_delaunay_2.cpp
index ef4daf114a7..9b23744f9ed 100644
--- a/Kernel_23/examples/Kernel_23/test_delaunay_2.cpp
+++ b/Kernel_23/examples/Kernel_23/test_delaunay_2.cpp
@@ -1,4 +1,3 @@
-
 // small example for compilation
 // check of Delaunay_triangulation_2 using the kernel concept
 // archetype
diff --git a/Kernel_23/examples/Kernel_23/test_polyhedron_prog_incr_builder.cpp b/Kernel_23/examples/Kernel_23/test_polyhedron_prog_incr_builder.cpp
index 0f3589ca44f..b42076181af 100644
--- a/Kernel_23/examples/Kernel_23/test_polyhedron_prog_incr_builder.cpp
+++ b/Kernel_23/examples/Kernel_23/test_polyhedron_prog_incr_builder.cpp
@@ -1,4 +1,3 @@
-
 // original version see examples/Polyhedron/polyhedron_prog_incr_builder.cpp
 // this time we test compilation with the
 // kernel concept archetype
diff --git a/Kernel_23/examples/Kernel_23/test_polyhedron_prog_incr_builder_own_archetype.cpp b/Kernel_23/examples/Kernel_23/test_polyhedron_prog_incr_builder_own_archetype.cpp
index 2079a731334..14e71031937 100644
--- a/Kernel_23/examples/Kernel_23/test_polyhedron_prog_incr_builder_own_archetype.cpp
+++ b/Kernel_23/examples/Kernel_23/test_polyhedron_prog_incr_builder_own_archetype.cpp
@@ -1,4 +1,3 @@
-
 // original version see examples/Polyhedron/polyhedron_prog_incr_builder.cpp
 // this time we test compilation with
 // an own archetype that uses functionality
diff --git a/Kinetic_data_structures/examples/Kinetic_framework/listener.cpp b/Kinetic_data_structures/examples/Kinetic_framework/listener.cpp
index 813649cce8a..481b314e645 100644
--- a/Kinetic_data_structures/examples/Kinetic_framework/listener.cpp
+++ b/Kinetic_data_structures/examples/Kinetic_framework/listener.cpp
@@ -79,4 +79,3 @@ int main(int, char *[])
 
   return EXIT_SUCCESS;
 }
-
diff --git a/Largest_empty_rect_2/examples/Largest_empty_rect_2/largest_empty_rectangle.cpp b/Largest_empty_rect_2/examples/Largest_empty_rect_2/largest_empty_rectangle.cpp
index 4b0b05a4467..2a37da9c0e0 100644
--- a/Largest_empty_rect_2/examples/Largest_empty_rect_2/largest_empty_rectangle.cpp
+++ b/Largest_empty_rect_2/examples/Largest_empty_rect_2/largest_empty_rectangle.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Iso_rectangle_2.h>
 #include <CGAL/Largest_empty_iso_rectangle_2.h>
diff --git a/Matrix_search/examples/Matrix_search/all_furthest_neighbors_2.cpp b/Matrix_search/examples/Matrix_search/all_furthest_neighbors_2.cpp
index b65ce3104ea..344aee76d96 100644
--- a/Matrix_search/examples/Matrix_search/all_furthest_neighbors_2.cpp
+++ b/Matrix_search/examples/Matrix_search/all_furthest_neighbors_2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
@@ -34,4 +33,3 @@ int main()
 // ----------------------------------------------------------------------------
 // ** EOF
 // ----------------------------------------------------------------------------
-
diff --git a/Matrix_search/examples/Matrix_search/rectangular_p_center_2.cpp b/Matrix_search/examples/Matrix_search/rectangular_p_center_2.cpp
index e5c02d7cfbb..e863112ec8b 100644
--- a/Matrix_search/examples/Matrix_search/rectangular_p_center_2.cpp
+++ b/Matrix_search/examples/Matrix_search/rectangular_p_center_2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/rectangular_p_center_2.h>
@@ -40,4 +39,3 @@ int main()
 // ----------------------------------------------------------------------------
 // ** EOF
 // ----------------------------------------------------------------------------
-
diff --git a/Matrix_search/examples/Matrix_search/sorted_matrix_search.cpp b/Matrix_search/examples/Matrix_search/sorted_matrix_search.cpp
index 8533f5fb11c..68a09d14ea8 100644
--- a/Matrix_search/examples/Matrix_search/sorted_matrix_search.cpp
+++ b/Matrix_search/examples/Matrix_search/sorted_matrix_search.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Random.h>
 #include <CGAL/Cartesian_matrix.h>
 #include <CGAL/sorted_matrix_search.h>
@@ -48,4 +47,3 @@ int main()
 // ----------------------------------------------------------------------------
 // ** EOF
 // ----------------------------------------------------------------------------
-
diff --git a/Mesh_2/examples/Mesh_2/conforming.cpp b/Mesh_2/examples/Mesh_2/conforming.cpp
index 28acb73a95c..f0ec1679034 100644
--- a/Mesh_2/examples/Mesh_2/conforming.cpp
+++ b/Mesh_2/examples/Mesh_2/conforming.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 #include <CGAL/Triangulation_conformer_2.h>
diff --git a/Mesh_2/examples/Mesh_2/mesh_class.cpp b/Mesh_2/examples/Mesh_2/mesh_class.cpp
index d2f02b8547e..d334613b5a8 100644
--- a/Mesh_2/examples/Mesh_2/mesh_class.cpp
+++ b/Mesh_2/examples/Mesh_2/mesh_class.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 #include <CGAL/Delaunay_mesher_2.h>
diff --git a/Mesh_2/examples/Mesh_2/mesh_global.cpp b/Mesh_2/examples/Mesh_2/mesh_global.cpp
index 60c09207ddc..6605c704727 100644
--- a/Mesh_2/examples/Mesh_2/mesh_global.cpp
+++ b/Mesh_2/examples/Mesh_2/mesh_global.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 #include <CGAL/Delaunay_mesher_2.h>
diff --git a/Mesh_2/examples/Mesh_2/mesh_with_seeds.cpp b/Mesh_2/examples/Mesh_2/mesh_with_seeds.cpp
index 6db6ccf8a19..04ac08209c7 100644
--- a/Mesh_2/examples/Mesh_2/mesh_with_seeds.cpp
+++ b/Mesh_2/examples/Mesh_2/mesh_with_seeds.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 #include <CGAL/Delaunay_mesher_2.h>
diff --git a/Min_annulus_d/examples/Min_annulus_d/min_annulus_d.cpp b/Min_annulus_d/examples/Min_annulus_d/min_annulus_d.cpp
index c2c4788018b..6c1b8ee5259 100644
--- a/Min_annulus_d/examples/Min_annulus_d/min_annulus_d.cpp
+++ b/Min_annulus_d/examples/Min_annulus_d/min_annulus_d.cpp
@@ -1,4 +1,3 @@
-
 // computes the smallest enclosing annulus of two point
 // sets on nested squares in R^2, using double
 // as input type and some internal EXACT floating point type
diff --git a/Min_annulus_d/examples/Min_annulus_d/min_annulus_d_fast_exact.cpp b/Min_annulus_d/examples/Min_annulus_d/min_annulus_d_fast_exact.cpp
index 6943ec17660..5391f04c994 100644
--- a/Min_annulus_d/examples/Min_annulus_d/min_annulus_d_fast_exact.cpp
+++ b/Min_annulus_d/examples/Min_annulus_d/min_annulus_d_fast_exact.cpp
@@ -1,4 +1,3 @@
-
 // computes the smallest enclosing annulus of two point
 // sets on nested squares in R^2,  using double
 // as input type and some internal EXACT floating point type;
diff --git a/Min_circle_2/examples/Min_circle_2/min_circle_2.cpp b/Min_circle_2/examples/Min_circle_2/min_circle_2.cpp
index dc934b26b19..107bfb1d98b 100644
--- a/Min_circle_2/examples/Min_circle_2/min_circle_2.cpp
+++ b/Min_circle_2/examples/Min_circle_2/min_circle_2.cpp
@@ -1,4 +1,3 @@
-
 // includes
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Min_circle_2.h>
diff --git a/Min_ellipse_2/examples/Min_ellipse_2/min_ellipse_2.cpp b/Min_ellipse_2/examples/Min_ellipse_2/min_ellipse_2.cpp
index c6c28d3780f..87054a5691f 100644
--- a/Min_ellipse_2/examples/Min_ellipse_2/min_ellipse_2.cpp
+++ b/Min_ellipse_2/examples/Min_ellipse_2/min_ellipse_2.cpp
@@ -1,4 +1,3 @@
-
 // includes
 #include <cassert>
 #include <CGAL/Cartesian.h>
diff --git a/Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp b/Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp
index 31e8001be5a..e95b462b816 100644
--- a/Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp
+++ b/Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
diff --git a/Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp b/Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp
index 6b0fd691627..3127cbb47ad 100644
--- a/Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp
+++ b/Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
@@ -28,4 +27,3 @@ int main()
 
   return 0;
 }
-
diff --git a/Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_strip_2.cpp b/Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_strip_2.cpp
index cb93ce7fdbd..bf87a3377a8 100644
--- a/Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_strip_2.cpp
+++ b/Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_strip_2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
@@ -27,4 +26,3 @@ int main()
 
   return 0;
 }
-
diff --git a/Min_sphere_d/examples/Min_sphere_d/min_sphere_d.cpp b/Min_sphere_d/examples/Min_sphere_d/min_sphere_d.cpp
index cec71d29731..a78b91bd077 100644
--- a/Min_sphere_d/examples/Min_sphere_d/min_sphere_d.cpp
+++ b/Min_sphere_d/examples/Min_sphere_d/min_sphere_d.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian_d.h>
 #include <iostream>
 #include <cstdlib>
@@ -33,4 +32,3 @@ int main ()
 
     return 0;
 }
-
diff --git a/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/benchmark.cpp b/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/benchmark.cpp
index f43df7eb78e..04d2a316cb9 100644
--- a/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/benchmark.cpp
+++ b/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/benchmark.cpp
@@ -1,4 +1,3 @@
-
 #include <iostream>
 #include <ctime>
 #include <CGAL/Min_sphere_of_spheres_d.h>
diff --git a/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_2.cpp b/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_2.cpp
index b8e8d688b40..897d247393b 100644
--- a/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_2.cpp
+++ b/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_2.cpp
@@ -1,4 +1,3 @@
-
 // Computes the minsphere of some random spheres.
 // This example illustrates how to use CGAL::Point_2 and CGAL::
 // Weighted_point with the Min_sphere_of_spheres_d package.
diff --git a/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_3.cpp b/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_3.cpp
index 96210935c78..c4548366442 100644
--- a/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_3.cpp
+++ b/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_3.cpp
@@ -1,4 +1,3 @@
-
 // Computes the minsphere of some random spheres.
 // This example illustrates how to use CGAL::Point_3 and CGAL::
 // Weighted_point with the Min_sphere_of_spheres_d package.
diff --git a/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_d.cpp b/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_d.cpp
index 6cce42794bc..5dfdb2af386 100644
--- a/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_d.cpp
+++ b/Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_d.cpp
@@ -1,4 +1,3 @@
-
 // Computes the minsphere of some random spheres.
 // This example illustrates how to use CGAL::Point_d and CGAL::
 // Weighted_point with the Min_sphere_of_spheres_d package.
diff --git a/Nef_2/examples/Nef_2/construction.cpp b/Nef_2/examples/Nef_2/construction.cpp
index 44156cd69d9..3a79532e54c 100644
--- a/Nef_2/examples/Nef_2/construction.cpp
+++ b/Nef_2/examples/Nef_2/construction.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpz.h>
 #include <CGAL/Filtered_extended_homogeneous.h>
 #include <CGAL/Nef_polyhedron_2.h>
@@ -26,5 +25,3 @@ int main() {
 
   return 0;
 }
-
-
diff --git a/Nef_2/examples/Nef_2/polylines.cpp b/Nef_2/examples/Nef_2/polylines.cpp
index 8cfb754f714..068247a9e47 100644
--- a/Nef_2/examples/Nef_2/polylines.cpp
+++ b/Nef_2/examples/Nef_2/polylines.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpq.h>
 #include <CGAL/Lazy_exact_nt.h>
 #include <CGAL/Simple_cartesian.h>
@@ -83,4 +82,3 @@ int main()
 
   return 0;
 }
-
diff --git a/Nef_2/examples/Nef_2/simple_intersection.cpp b/Nef_2/examples/Nef_2/simple_intersection.cpp
index ba328c26961..a0597b2c280 100644
--- a/Nef_2/examples/Nef_2/simple_intersection.cpp
+++ b/Nef_2/examples/Nef_2/simple_intersection.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpz.h>
 #include <CGAL/Filtered_extended_homogeneous.h>
 #include <CGAL/Nef_polyhedron_2.h>
@@ -15,5 +14,3 @@ int main()
   Nef_polyhedron N3 = N1 * N2; // line (*)
   return 0;
 }
-
-
diff --git a/Nef_3/examples/Nef_3/complex_construction.cpp b/Nef_3/examples/Nef_3/complex_construction.cpp
index 82bd8910459..6d12f0cf9d5 100644
--- a/Nef_3/examples/Nef_3/complex_construction.cpp
+++ b/Nef_3/examples/Nef_3/complex_construction.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>
 #include <CGAL/OFF_to_nef_3.h>
diff --git a/Nef_3/examples/Nef_3/construction.cpp b/Nef_3/examples/Nef_3/construction.cpp
index 1c337758bd2..dd2fcdb8e6e 100644
--- a/Nef_3/examples/Nef_3/construction.cpp
+++ b/Nef_3/examples/Nef_3/construction.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpz.h>
 #include <CGAL/Extended_homogeneous.h>
 #include <CGAL/Nef_polyhedron_3.h>
diff --git a/Nef_3/examples/Nef_3/exploration_SM.cpp b/Nef_3/examples/Nef_3/exploration_SM.cpp
index 542a104caa2..c80c97df419 100644
--- a/Nef_3/examples/Nef_3/exploration_SM.cpp
+++ b/Nef_3/examples/Nef_3/exploration_SM.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Nef_polyhedron_3.h>
diff --git a/Nef_3/examples/Nef_3/extended_kernel.cpp b/Nef_3/examples/Nef_3/extended_kernel.cpp
index c06599332ae..cc5a2635b07 100644
--- a/Nef_3/examples/Nef_3/extended_kernel.cpp
+++ b/Nef_3/examples/Nef_3/extended_kernel.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpz.h>
 #include <CGAL/Extended_homogeneous.h>
 #include <CGAL/Nef_polyhedron_3.h>
diff --git a/Nef_3/examples/Nef_3/interface_polyhedron.cpp b/Nef_3/examples/Nef_3/interface_polyhedron.cpp
index 338cb1427e0..9daf2cb142e 100644
--- a/Nef_3/examples/Nef_3/interface_polyhedron.cpp
+++ b/Nef_3/examples/Nef_3/interface_polyhedron.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Polyhedron_3.h>
diff --git a/Nef_3/examples/Nef_3/nefIO.cpp b/Nef_3/examples/Nef_3/nefIO.cpp
index c76911b6fb1..7147621e190 100644
--- a/Nef_3/examples/Nef_3/nefIO.cpp
+++ b/Nef_3/examples/Nef_3/nefIO.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Extended_homogeneous.h>
diff --git a/Nef_3/examples/Nef_3/point_location.cpp b/Nef_3/examples/Nef_3/point_location.cpp
index e0654f7a034..55deb18ea58 100644
--- a/Nef_3/examples/Nef_3/point_location.cpp
+++ b/Nef_3/examples/Nef_3/point_location.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Nef_polyhedron_3.h>
@@ -37,4 +36,3 @@ int main() {
 
   return 0;
 }
-
diff --git a/Nef_3/examples/Nef_3/point_set_operations.cpp b/Nef_3/examples/Nef_3/point_set_operations.cpp
index 8ace191fa0e..3b4ff086333 100644
--- a/Nef_3/examples/Nef_3/point_set_operations.cpp
+++ b/Nef_3/examples/Nef_3/point_set_operations.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpz.h>
 #include <CGAL/Extended_homogeneous.h>
 #include <CGAL/Nef_polyhedron_3.h>
diff --git a/Nef_3/examples/Nef_3/shell_exploration.cpp b/Nef_3/examples/Nef_3/shell_exploration.cpp
index f4c81789298..d85d619e870 100644
--- a/Nef_3/examples/Nef_3/shell_exploration.cpp
+++ b/Nef_3/examples/Nef_3/shell_exploration.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Nef_polyhedron_3.h>
diff --git a/Nef_3/examples/Nef_3/simple.cpp b/Nef_3/examples/Nef_3/simple.cpp
index 532905c8fb8..d6e29da74f2 100644
--- a/Nef_3/examples/Nef_3/simple.cpp
+++ b/Nef_3/examples/Nef_3/simple.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Nef_polyhedron_3.h>
diff --git a/Nef_S2/examples/Nef_S2/construction.cpp b/Nef_S2/examples/Nef_S2/construction.cpp
index b4eba4bceab..b585ebff036 100644
--- a/Nef_S2/examples/Nef_S2/construction.cpp
+++ b/Nef_S2/examples/Nef_S2/construction.cpp
@@ -29,5 +29,3 @@ int main() {
 
   return 0;
 }
-
-
diff --git a/Nef_S2/examples/Nef_S2/exploration.cpp b/Nef_S2/examples/Nef_S2/exploration.cpp
index b00aee177d9..dd608b932bd 100644
--- a/Nef_S2/examples/Nef_S2/exploration.cpp
+++ b/Nef_S2/examples/Nef_S2/exploration.cpp
@@ -44,5 +44,3 @@ int main() {
   }
   return 0;
 }
-
-
diff --git a/Nef_S2/examples/Nef_S2/point_location.cpp b/Nef_S2/examples/Nef_S2/point_location.cpp
index 52078c1925e..b8bb0112305 100644
--- a/Nef_S2/examples/Nef_S2/point_location.cpp
+++ b/Nef_S2/examples/Nef_S2/point_location.cpp
@@ -37,5 +37,3 @@ int main() {
   }
   return 0;
 }
-
-
diff --git a/PDB/examples/PDB/pdb_align.cpp b/PDB/examples/PDB/pdb_align.cpp
index 030220a8f5a..d1279b80241 100644
--- a/PDB/examples/PDB/pdb_align.cpp
+++ b/PDB/examples/PDB/pdb_align.cpp
@@ -137,4 +137,3 @@ int main(int argc, char *argv[]){
   return EXIT_SUCCESS;
 
 }
-
diff --git a/PDB/examples/PDB/pdb_align_points.cpp b/PDB/examples/PDB/pdb_align_points.cpp
index ee83c87812f..c600647e825 100644
--- a/PDB/examples/PDB/pdb_align_points.cpp
+++ b/PDB/examples/PDB/pdb_align_points.cpp
@@ -205,4 +205,3 @@ int main(int argc, char *argv[]){
   return EXIT_SUCCESS;
 
 }
-
diff --git a/PDB/examples/PDB/pdb_distance.cpp b/PDB/examples/PDB/pdb_distance.cpp
index 1d75e1217c1..7e4b21d188b 100644
--- a/PDB/examples/PDB/pdb_distance.cpp
+++ b/PDB/examples/PDB/pdb_distance.cpp
@@ -228,4 +228,3 @@ int main(int argc, char *argv[]){
   return EXIT_SUCCESS;
 
 }
-
diff --git a/PDB/examples/PDB/pdb_distances.cpp b/PDB/examples/PDB/pdb_distances.cpp
index 62dfc85262d..b5988f8261c 100644
--- a/PDB/examples/PDB/pdb_distances.cpp
+++ b/PDB/examples/PDB/pdb_distances.cpp
@@ -129,6 +129,3 @@ int main(int argc, char *argv[]){
 
   return EXIT_SUCCESS;
 }
-
-
-
diff --git a/Partition_2/examples/Partition_2/approx_convex_partition_2.cpp b/Partition_2/examples/Partition_2/approx_convex_partition_2.cpp
index ecbd0aef4bc..24350529b95 100644
--- a/Partition_2/examples/Partition_2/approx_convex_partition_2.cpp
+++ b/Partition_2/examples/Partition_2/approx_convex_partition_2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Partition_traits_2.h>
diff --git a/Partition_2/examples/Partition_2/greene_approx_convex_partition_2.cpp b/Partition_2/examples/Partition_2/greene_approx_convex_partition_2.cpp
index 9939c3e3b95..2e3d7ea0167 100644
--- a/Partition_2/examples/Partition_2/greene_approx_convex_partition_2.cpp
+++ b/Partition_2/examples/Partition_2/greene_approx_convex_partition_2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Partition_traits_2.h>
diff --git a/Partition_2/examples/Partition_2/optimal_convex_partition_2.cpp b/Partition_2/examples/Partition_2/optimal_convex_partition_2.cpp
index 97603d60d63..ea2337c84ac 100644
--- a/Partition_2/examples/Partition_2/optimal_convex_partition_2.cpp
+++ b/Partition_2/examples/Partition_2/optimal_convex_partition_2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Partition_traits_2.h>
diff --git a/Partition_2/examples/Partition_2/y_monotone_partition_2.cpp b/Partition_2/examples/Partition_2/y_monotone_partition_2.cpp
index a93c58b8fd3..bf5df3a65e6 100644
--- a/Partition_2/examples/Partition_2/y_monotone_partition_2.cpp
+++ b/Partition_2/examples/Partition_2/y_monotone_partition_2.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Partition_traits_2.h>
diff --git a/Point_set_2/examples/Point_set_2/nearest_neighbor.cpp b/Point_set_2/examples/Point_set_2/nearest_neighbor.cpp
index c98523d4faf..d22b37894d2 100644
--- a/Point_set_2/examples/Point_set_2/nearest_neighbor.cpp
+++ b/Point_set_2/examples/Point_set_2/nearest_neighbor.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Point_set_2.h>
 #include <list>
diff --git a/Point_set_2/examples/Point_set_2/range_search.cpp b/Point_set_2/examples/Point_set_2/range_search.cpp
index c0c770655af..d7b62838e55 100644
--- a/Point_set_2/examples/Point_set_2/range_search.cpp
+++ b/Point_set_2/examples/Point_set_2/range_search.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Point_set_2.h>
 #include <list>
diff --git a/Polygon/examples/Polygon/Example.cpp b/Polygon/examples/Polygon/Example.cpp
index 4a740904726..75769c1f4fc 100644
--- a/Polygon/examples/Polygon/Example.cpp
+++ b/Polygon/examples/Polygon/Example.cpp
@@ -1,4 +1,3 @@
-
 //-----------------------------------------------------------------------//
 // This is just a simple example that demonstrates how to use the
 // class CGAL::Polygon_2.
@@ -78,4 +77,3 @@ int main()
 
   return 0;
 }
-
diff --git a/Polygon/examples/Polygon/Polygon.cpp b/Polygon/examples/Polygon/Polygon.cpp
index ad12b0ef86e..752d04abe6e 100644
--- a/Polygon/examples/Polygon/Polygon.cpp
+++ b/Polygon/examples/Polygon/Polygon.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <iostream>
@@ -24,4 +23,3 @@ int main()
 
   return 0;
 }
-
diff --git a/Polygon/examples/Polygon/polygon_algorithms.cpp b/Polygon/examples/Polygon/polygon_algorithms.cpp
index b4e427baa47..e643f2afe8d 100644
--- a/Polygon/examples/Polygon/polygon_algorithms.cpp
+++ b/Polygon/examples/Polygon/polygon_algorithms.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2_algorithms.h>
 #include <iostream>
@@ -38,4 +37,3 @@ int main()
 
   return 0;
 }
-
diff --git a/Polyhedron/examples/Polyhedron/polyhedron_prog_cube.cpp b/Polyhedron/examples/Polyhedron/polyhedron_prog_cube.cpp
index e7d5a9f1089..b2e9608d86d 100644
--- a/Polyhedron/examples/Polyhedron/polyhedron_prog_cube.cpp
+++ b/Polyhedron/examples/Polyhedron/polyhedron_prog_cube.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polyhedron_3.h>
 #include <iostream>
diff --git a/Polyhedron/examples/Polyhedron/polyhedron_prog_incr_builder.cpp b/Polyhedron/examples/Polyhedron/polyhedron_prog_incr_builder.cpp
index 9b381d86d99..eb51eb209e3 100644
--- a/Polyhedron/examples/Polyhedron/polyhedron_prog_incr_builder.cpp
+++ b/Polyhedron/examples/Polyhedron/polyhedron_prog_incr_builder.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polyhedron_incremental_builder_3.h>
 #include <CGAL/Polyhedron_3.h>
diff --git a/Polyhedron/examples/Polyhedron/polyhedron_prog_normals.cpp b/Polyhedron/examples/Polyhedron/polyhedron_prog_normals.cpp
index 99b3a64d232..15f044a9e97 100644
--- a/Polyhedron/examples/Polyhedron/polyhedron_prog_normals.cpp
+++ b/Polyhedron/examples/Polyhedron/polyhedron_prog_normals.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Polyhedron_traits_with_normals_3.h>
 #include <CGAL/Polyhedron_3.h>
diff --git a/Polyhedron/examples/Polyhedron/polyhedron_prog_off.cpp b/Polyhedron/examples/Polyhedron/polyhedron_prog_off.cpp
index 3160466813c..cecca0428e8 100644
--- a/Polyhedron/examples/Polyhedron/polyhedron_prog_off.cpp
+++ b/Polyhedron/examples/Polyhedron/polyhedron_prog_off.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polyhedron_3.h>
 #include <iostream>
diff --git a/Polyhedron/examples/Polyhedron/polyhedron_prog_planes.cpp b/Polyhedron/examples/Polyhedron/polyhedron_prog_planes.cpp
index a6552217bb7..75268ba3759 100644
--- a/Polyhedron/examples/Polyhedron/polyhedron_prog_planes.cpp
+++ b/Polyhedron/examples/Polyhedron/polyhedron_prog_planes.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Polyhedron_3.h>
 #include <iostream>
diff --git a/Polyhedron/examples/Polyhedron/polyhedron_prog_simple.cpp b/Polyhedron/examples/Polyhedron/polyhedron_prog_simple.cpp
index d2162654885..3527fe3787e 100644
--- a/Polyhedron/examples/Polyhedron/polyhedron_prog_simple.cpp
+++ b/Polyhedron/examples/Polyhedron/polyhedron_prog_simple.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polyhedron_3.h>
 
diff --git a/Polyhedron/examples/Polyhedron/polyhedron_prog_subdiv.cpp b/Polyhedron/examples/Polyhedron/polyhedron_prog_subdiv.cpp
index 60b3ac2b3d1..e3ab46c85a5 100644
--- a/Polyhedron/examples/Polyhedron/polyhedron_prog_subdiv.cpp
+++ b/Polyhedron/examples/Polyhedron/polyhedron_prog_subdiv.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/IO/Polyhedron_iostream.h>
diff --git a/Polyhedron/examples/Polyhedron/polyhedron_prog_subdiv_with_boundary.cpp b/Polyhedron/examples/Polyhedron/polyhedron_prog_subdiv_with_boundary.cpp
index f05537c2dd8..31861af9210 100644
--- a/Polyhedron/examples/Polyhedron/polyhedron_prog_subdiv_with_boundary.cpp
+++ b/Polyhedron/examples/Polyhedron/polyhedron_prog_subdiv_with_boundary.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/IO/Polyhedron_iostream.h>
diff --git a/Polyhedron/examples/Polyhedron/polyhedron_prog_tetra.cpp b/Polyhedron/examples/Polyhedron/polyhedron_prog_tetra.cpp
index 30c61446bed..d610ded2099 100644
--- a/Polyhedron/examples/Polyhedron/polyhedron_prog_tetra.cpp
+++ b/Polyhedron/examples/Polyhedron/polyhedron_prog_tetra.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polyhedron_3.h>
 #include <iostream>
diff --git a/Polyhedron/examples/Polyhedron/polyhedron_prog_traits.cpp b/Polyhedron/examples/Polyhedron/polyhedron_prog_traits.cpp
index 4e0abc9dada..c77d71484de 100644
--- a/Polyhedron/examples/Polyhedron/polyhedron_prog_traits.cpp
+++ b/Polyhedron/examples/Polyhedron/polyhedron_prog_traits.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polyhedron_traits_3.h>
 #include <CGAL/Polyhedron_3.h>
diff --git a/Polyhedron/examples/Polyhedron/polyhedron_prog_vector.cpp b/Polyhedron/examples/Polyhedron/polyhedron_prog_vector.cpp
index 4b95a15b2a8..b90e7456373 100644
--- a/Polyhedron/examples/Polyhedron/polyhedron_prog_vector.cpp
+++ b/Polyhedron/examples/Polyhedron/polyhedron_prog_vector.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/HalfedgeDS_vector.h>
 #include <CGAL/Polyhedron_3.h>
diff --git a/Polyhedron_IO/examples/Polyhedron_IO/iv2off.cpp b/Polyhedron_IO/examples/Polyhedron_IO/iv2off.cpp
index b4779c61277..d71ac7095a1 100644
--- a/Polyhedron_IO/examples/Polyhedron_IO/iv2off.cpp
+++ b/Polyhedron_IO/examples/Polyhedron_IO/iv2off.cpp
@@ -1,4 +1,3 @@
-
 // Converts Geometry Information in Inventor files (*.iv) into OFF format.
 // The scanner triggers on Coordinate3, IndexedFaceSet, and IndexedLineSet
 // keywords. It does not recognize transformations nor groups.
diff --git a/Polyhedron_IO/examples/Polyhedron_IO/off2iv.cpp b/Polyhedron_IO/examples/Polyhedron_IO/off2iv.cpp
index e43ef464d9b..d93500ec6fa 100644
--- a/Polyhedron_IO/examples/Polyhedron_IO/off2iv.cpp
+++ b/Polyhedron_IO/examples/Polyhedron_IO/off2iv.cpp
@@ -1,4 +1,3 @@
-
 // Convert from OFF format to OpenInventor (.iv) format.
 
 #include <CGAL/basic.h>
diff --git a/Polyhedron_IO/examples/Polyhedron_IO/off2off.cpp b/Polyhedron_IO/examples/Polyhedron_IO/off2off.cpp
index 165241a7f93..877956f482d 100644
--- a/Polyhedron_IO/examples/Polyhedron_IO/off2off.cpp
+++ b/Polyhedron_IO/examples/Polyhedron_IO/off2off.cpp
@@ -1,4 +1,3 @@
-
 // Copies a file in OFF format.
 
 #include <CGAL/basic.h>
diff --git a/Polyhedron_IO/examples/Polyhedron_IO/off2stl.cpp b/Polyhedron_IO/examples/Polyhedron_IO/off2stl.cpp
index 40e65356c9b..71e2c2b7723 100644
--- a/Polyhedron_IO/examples/Polyhedron_IO/off2stl.cpp
+++ b/Polyhedron_IO/examples/Polyhedron_IO/off2stl.cpp
@@ -1,4 +1,3 @@
-
 // Convert from OFF format to StereoLithography StL format.
 
 #include <CGAL/Simple_cartesian.h>
diff --git a/Polyhedron_IO/examples/Polyhedron_IO/off2vrml.cpp b/Polyhedron_IO/examples/Polyhedron_IO/off2vrml.cpp
index 4517b9eebd4..1e3a49d79d0 100644
--- a/Polyhedron_IO/examples/Polyhedron_IO/off2vrml.cpp
+++ b/Polyhedron_IO/examples/Polyhedron_IO/off2vrml.cpp
@@ -1,4 +1,3 @@
-
 // Convert from OFF format to VRML (.wrl) 1.0 or 2.0 format.
 
 #include <CGAL/basic.h>
diff --git a/Polyhedron_IO/examples/Polyhedron_IO/off2wav.cpp b/Polyhedron_IO/examples/Polyhedron_IO/off2wav.cpp
index ad39d8b1d8b..e0ad53b79df 100644
--- a/Polyhedron_IO/examples/Polyhedron_IO/off2wav.cpp
+++ b/Polyhedron_IO/examples/Polyhedron_IO/off2wav.cpp
@@ -1,4 +1,3 @@
-
 // Convert from OFF format to Wavefront (.obj) format.
 
 #include <CGAL/basic.h>
diff --git a/Polyhedron_IO/examples/Polyhedron_IO/off_bbox.cpp b/Polyhedron_IO/examples/Polyhedron_IO/off_bbox.cpp
index 024ceafc24a..74874a1d452 100644
--- a/Polyhedron_IO/examples/Polyhedron_IO/off_bbox.cpp
+++ b/Polyhedron_IO/examples/Polyhedron_IO/off_bbox.cpp
@@ -1,4 +1,3 @@
-
 // computes bbox of an OFF object.
 
 #include <CGAL/basic.h>
diff --git a/Polyhedron_IO/examples/Polyhedron_IO/off_glue.cpp b/Polyhedron_IO/examples/Polyhedron_IO/off_glue.cpp
index 2977b1ab178..9ea7e1f0bb1 100644
--- a/Polyhedron_IO/examples/Polyhedron_IO/off_glue.cpp
+++ b/Polyhedron_IO/examples/Polyhedron_IO/off_glue.cpp
@@ -1,4 +1,3 @@
-
 // Glue vertices of a polyhedron together that have equal coordinate values.
 
 #include <CGAL/Cartesian.h>
@@ -207,4 +206,3 @@ int main( int argc, char **argv) {
     return 0;
 }
 // EOF //
-
diff --git a/Polyhedron_IO/examples/Polyhedron_IO/off_transform.cpp b/Polyhedron_IO/examples/Polyhedron_IO/off_transform.cpp
index 6afe123de02..1b9d655b0b3 100644
--- a/Polyhedron_IO/examples/Polyhedron_IO/off_transform.cpp
+++ b/Polyhedron_IO/examples/Polyhedron_IO/off_transform.cpp
@@ -1,4 +1,3 @@
-
 // Applies translation and scaling to an OFF object.
 
 #include <CGAL/Cartesian.h>
diff --git a/Polyhedron_IO/examples/Polyhedron_IO/polyhedron2vrml.cpp b/Polyhedron_IO/examples/Polyhedron_IO/polyhedron2vrml.cpp
index ab7b3e7179b..a2466f354e1 100644
--- a/Polyhedron_IO/examples/Polyhedron_IO/polyhedron2vrml.cpp
+++ b/Polyhedron_IO/examples/Polyhedron_IO/polyhedron2vrml.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/IO/Polyhedron_iostream.h>
diff --git a/Polyhedron_IO/examples/Polyhedron_IO/polyhedron_copy.cpp b/Polyhedron_IO/examples/Polyhedron_IO/polyhedron_copy.cpp
index 301dbd048ad..31d3c3d1e56 100644
--- a/Polyhedron_IO/examples/Polyhedron_IO/polyhedron_copy.cpp
+++ b/Polyhedron_IO/examples/Polyhedron_IO/polyhedron_copy.cpp
@@ -1,4 +1,3 @@
-
 // Copies a CGAL::Polyhedron_3 from OFF format to OFF format.
 
 #include <CGAL/Cartesian.h>
diff --git a/Polytope_distance_d/examples/Polytope_distance_d/polytope_distance_d.cpp b/Polytope_distance_d/examples/Polytope_distance_d/polytope_distance_d.cpp
index 637a401fab4..dc2e1d55f5a 100644
--- a/Polytope_distance_d/examples/Polytope_distance_d/polytope_distance_d.cpp
+++ b/Polytope_distance_d/examples/Polytope_distance_d/polytope_distance_d.cpp
@@ -1,4 +1,3 @@
-
 // computes the distance between two cubes in R^3 using double
 // as input type and some internal EXACT floating point type
 #include <iostream>
diff --git a/Polytope_distance_d/examples/Polytope_distance_d/polytope_distance_d_fast_exact.cpp b/Polytope_distance_d/examples/Polytope_distance_d/polytope_distance_d_fast_exact.cpp
index 746c1cad7aa..def521f249c 100644
--- a/Polytope_distance_d/examples/Polytope_distance_d/polytope_distance_d_fast_exact.cpp
+++ b/Polytope_distance_d/examples/Polytope_distance_d/polytope_distance_d_fast_exact.cpp
@@ -1,4 +1,3 @@
-
 // computes the distance between two cubes in R^3 using double
 // as input type and some internal EXACT floating point type;
 // the fast type double is also safely used for many of the
diff --git a/Reconstruction_from_slices_3/examples/Reconstruction_from_slices_3/test_reconstruction_from_slices.cpp b/Reconstruction_from_slices_3/examples/Reconstruction_from_slices_3/test_reconstruction_from_slices.cpp
index 09666102a72..5ca014ed389 100644
--- a/Reconstruction_from_slices_3/examples/Reconstruction_from_slices_3/test_reconstruction_from_slices.cpp
+++ b/Reconstruction_from_slices_3/examples/Reconstruction_from_slices_3/test_reconstruction_from_slices.cpp
@@ -186,5 +186,3 @@ int main (int argc , char ** argv)
 #endif //GEOMVIEW
   return 0;
 }
-
-
diff --git a/Reconstruction_from_slices_3/examples/Reconstruction_from_slices_3/test_triangulation_points_in_polylines.cpp b/Reconstruction_from_slices_3/examples/Reconstruction_from_slices_3/test_triangulation_points_in_polylines.cpp
index 3c7760df12e..b0d2be39099 100644
--- a/Reconstruction_from_slices_3/examples/Reconstruction_from_slices_3/test_triangulation_points_in_polylines.cpp
+++ b/Reconstruction_from_slices_3/examples/Reconstruction_from_slices_3/test_triangulation_points_in_polylines.cpp
@@ -93,5 +93,3 @@ int main (int argc , char ** argv)
 #endif //GEOMVIEW
   return 0;
 }
-
-
diff --git a/Reconstruction_from_slices_3/examples/Reconstruction_from_slices_3/test_triangulation_points_in_slices.cpp b/Reconstruction_from_slices_3/examples/Reconstruction_from_slices_3/test_triangulation_points_in_slices.cpp
index f2145f20442..40c6d272db8 100644
--- a/Reconstruction_from_slices_3/examples/Reconstruction_from_slices_3/test_triangulation_points_in_slices.cpp
+++ b/Reconstruction_from_slices_3/examples/Reconstruction_from_slices_3/test_triangulation_points_in_slices.cpp
@@ -74,5 +74,3 @@ int main (int argc , char ** argv)
 
   return 0;
 }
-
-
diff --git a/Ridges_3/examples/Ridges_3/PolyhedralSurf.cpp b/Ridges_3/examples/Ridges_3/PolyhedralSurf.cpp
index 1f53f2d2c8b..8e6a6da337a 100644
--- a/Ridges_3/examples/Ridges_3/PolyhedralSurf.cpp
+++ b/Ridges_3/examples/Ridges_3/PolyhedralSurf.cpp
@@ -33,4 +33,3 @@ const Vector_3 PolyhedralSurf::computeFacetsAverageUnitNormal(const Vertex_const
   sum = sum / std::sqrt(sum * sum);
   return sum;
 }
-
diff --git a/Ridges_3/examples/Ridges_3/blind.cpp b/Ridges_3/examples/Ridges_3/blind.cpp
index c5a8536234e..d1ff11f1181 100644
--- a/Ridges_3/examples/Ridges_3/blind.cpp
+++ b/Ridges_3/examples/Ridges_3/blind.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Ridges.h>
 #include <CGAL/Umbilics.h>
@@ -341,4 +340,3 @@ int main(int argc, char *argv[])
 
   return 0;
 }
-
diff --git a/STL_Extension/examples/STL_Extension/in_place_list_prog.cpp b/STL_Extension/examples/STL_Extension/in_place_list_prog.cpp
index 7e6cf22774c..d9fbabef4c7 100644
--- a/STL_Extension/examples/STL_Extension/in_place_list_prog.cpp
+++ b/STL_Extension/examples/STL_Extension/in_place_list_prog.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/basic.h>
 #include <cassert>
 #include <algorithm>
diff --git a/STL_Extension/examples/STL_Extension/min_element_if_example_noheader.cpp b/STL_Extension/examples/STL_Extension/min_element_if_example_noheader.cpp
index 08f00867116..d513e5b37cc 100644
--- a/STL_Extension/examples/STL_Extension/min_element_if_example_noheader.cpp
+++ b/STL_Extension/examples/STL_Extension/min_element_if_example_noheader.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/algorithm.h>
 #include <CGAL/function_objects.h>
 #include <vector>
diff --git a/STL_Extension/examples/STL_Extension/min_max_element_example_noheader.cpp b/STL_Extension/examples/STL_Extension/min_max_element_example_noheader.cpp
index b04a806828b..44ae2403fa2 100644
--- a/STL_Extension/examples/STL_Extension/min_max_element_example_noheader.cpp
+++ b/STL_Extension/examples/STL_Extension/min_max_element_example_noheader.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/algorithm.h>
 #include <vector>
 #include <iostream>
diff --git a/SearchStructures/examples/RangeSegmentTrees/range_tree_1.cpp b/SearchStructures/examples/RangeSegmentTrees/range_tree_1.cpp
index 4c1f56a70ae..a32820982c4 100644
--- a/SearchStructures/examples/RangeSegmentTrees/range_tree_1.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/range_tree_1.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 1-dimensional Range Trees
 // A two dimensional Range Tree is defined in this class.
 // Ti is the type of each dimension of the tree.
@@ -55,5 +54,3 @@ int main()
     std::cerr << "Tree is not valid\n";
   return 0;
 }
-
-
diff --git a/SearchStructures/examples/RangeSegmentTrees/range_tree_2.cpp b/SearchStructures/examples/RangeSegmentTrees/range_tree_2.cpp
index 89f0cde662e..532d610624a 100644
--- a/SearchStructures/examples/RangeSegmentTrees/range_tree_2.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/range_tree_2.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 2-dimensional Range Trees
 // A two dimensional Range Tree is defined in this class.
 // Ti is the type of each dimension of the tree.
@@ -57,5 +56,3 @@ int main()
 
   return 0;
 }
-
-
diff --git a/SearchStructures/examples/RangeSegmentTrees/range_tree_3.cpp b/SearchStructures/examples/RangeSegmentTrees/range_tree_3.cpp
index 6cc32499b48..90a044443af 100644
--- a/SearchStructures/examples/RangeSegmentTrees/range_tree_3.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/range_tree_3.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 3-dimensional Range Trees
 // A three dimensional Range Tree is defined in this class.
 // Ti is the type of each dimension of the tree.
@@ -58,19 +57,3 @@ int main()
 
   return 0;
 }
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/SearchStructures/examples/RangeSegmentTrees/range_tree_4.cpp b/SearchStructures/examples/RangeSegmentTrees/range_tree_4.cpp
index 5b9a64fac3b..fc059238aa3 100644
--- a/SearchStructures/examples/RangeSegmentTrees/range_tree_4.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/range_tree_4.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 4-dimensional Range Trees
 // A four dimensional Range Tree is defined in this class.
 // Ti is the type of each dimension of the tree.
@@ -56,5 +55,3 @@ int main()
 
   return 0;
 }
-
-
diff --git a/SearchStructures/examples/RangeSegmentTrees/range_tree_map_2.cpp b/SearchStructures/examples/RangeSegmentTrees/range_tree_map_2.cpp
index 754b45029cb..66add8b266f 100644
--- a/SearchStructures/examples/RangeSegmentTrees/range_tree_map_2.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/range_tree_map_2.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 2-dimensional Range Trees
 // A two dimensional Range Tree is defined in this class.
 // Ti is the type of each dimension of the tree.
@@ -62,5 +61,3 @@ int main()
     std::cerr << "Tree is not valid\n";
   return 0;
 }
-
-
diff --git a/SearchStructures/examples/RangeSegmentTrees/range_tree_set_2.cpp b/SearchStructures/examples/RangeSegmentTrees/range_tree_set_2.cpp
index e188788657b..f5c7d4c65f2 100644
--- a/SearchStructures/examples/RangeSegmentTrees/range_tree_set_2.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/range_tree_set_2.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 2-dimensional Range Trees
 // A two dimensional Range Tree is defined in this class.
 // Ti is the type of each dimension of the tree.
@@ -62,5 +61,3 @@ int main()
 
   return 0;
 }
-
-
diff --git a/SearchStructures/examples/RangeSegmentTrees/segment_tree_1.cpp b/SearchStructures/examples/RangeSegmentTrees/segment_tree_1.cpp
index c2f8c870550..632e88826c8 100644
--- a/SearchStructures/examples/RangeSegmentTrees/segment_tree_1.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/segment_tree_1.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 1-dimensional Segment Trees
 // A one dimensional Segment Tree is defined in this class.
 // Ti is the type of each dimension of the tree.
@@ -61,5 +60,3 @@ int main()
     std::cerr << "Tree is not valid\n";
   return 0;
 }
-
-
diff --git a/SearchStructures/examples/RangeSegmentTrees/segment_tree_2.cpp b/SearchStructures/examples/RangeSegmentTrees/segment_tree_2.cpp
index ff96e155abb..7856611345f 100644
--- a/SearchStructures/examples/RangeSegmentTrees/segment_tree_2.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/segment_tree_2.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 2-dimensional Segment Trees
 // A two dimensional Segment Tree is defined in this class.
 // Ti is the type of each dimension of the tree.
diff --git a/SearchStructures/examples/RangeSegmentTrees/segment_tree_3.cpp b/SearchStructures/examples/RangeSegmentTrees/segment_tree_3.cpp
index 6c7e2ac3a76..439698fd085 100644
--- a/SearchStructures/examples/RangeSegmentTrees/segment_tree_3.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/segment_tree_3.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 3-dimensional Segment Trees
 // A three dimensional Segment Tree is defined in this class.
 // Ti is the type of each dimension of the tree.
@@ -64,5 +63,3 @@ int main()
     std::cerr << "Tree is not valid\n";
   return 0;
 }
-
-
diff --git a/SearchStructures/examples/RangeSegmentTrees/segment_tree_4.cpp b/SearchStructures/examples/RangeSegmentTrees/segment_tree_4.cpp
index 06e3b545ef6..6730ab2946d 100644
--- a/SearchStructures/examples/RangeSegmentTrees/segment_tree_4.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/segment_tree_4.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 4-dimensional Segment Trees
 // A four dimensional Segment Tree is defined in this class.
 // Ti is the type of each dimension of the tree.
@@ -66,5 +65,3 @@ int main()
     std::cerr << "Tree is not valid\n";
   return 0;
 }
-
-
diff --git a/SearchStructures/examples/RangeSegmentTrees/segment_tree_map_2.cpp b/SearchStructures/examples/RangeSegmentTrees/segment_tree_map_2.cpp
index a0499c36d72..7a0316768db 100644
--- a/SearchStructures/examples/RangeSegmentTrees/segment_tree_map_2.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/segment_tree_map_2.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 2-dimensional Segment Trees
 // A two dimensional Segment Tree is defined in this class.
 // Ti is the type of each dimension of the tree.
@@ -75,5 +74,3 @@ int main()
     std::cerr << "Tree is not valid\n";
   return 0;
 }
-
-
diff --git a/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_2.cpp b/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_2.cpp
index 71ae90fb52f..055bc77aae8 100644
--- a/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_2.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_2.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 2-dimensional Segment Trees
 // Example for the construction of a two dimensional segment tree.
 // The data type of the first dimension is double and for the second
@@ -71,5 +70,3 @@ int main()
     std::cerr << "Tree is not valid\n";
   return 0;
 }
-
-
diff --git a/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_3.cpp b/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_3.cpp
index e977b9cb60f..e34198c3787 100644
--- a/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_3.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/segment_tree_set_3.cpp
@@ -1,4 +1,3 @@
-
 // Implementation: Testprogram for 3-dimensional Segment Trees
 // A three dimensional Segment Tree is defined in this class.
 // Ti is the type of each dimension of the tree.
@@ -68,5 +67,3 @@ int main()
     std::cerr << "Tree is not valid\n";
   return 0;
 }
-
-
diff --git a/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/sdg-filtered-traits.cpp b/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/sdg-filtered-traits.cpp
index d03f28ab887..595eb8f8cc3 100644
--- a/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/sdg-filtered-traits.cpp
+++ b/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/sdg-filtered-traits.cpp
@@ -41,5 +41,3 @@ int main()
 
   return 0;
 }
-
-
diff --git a/Spatial_searching/examples/Spatial_searching/circular_query.cpp b/Spatial_searching/examples/Spatial_searching/circular_query.cpp
index 175537330a1..827048fe408 100644
--- a/Spatial_searching/examples/Spatial_searching/circular_query.cpp
+++ b/Spatial_searching/examples/Spatial_searching/circular_query.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Kd_tree.h>
 #include <CGAL/point_generators_2.h>
@@ -42,4 +41,3 @@ int main() {
 
   return 0;
 };
-
diff --git a/Spatial_searching/examples/Spatial_searching/distance_browsing.cpp b/Spatial_searching/examples/Spatial_searching/distance_browsing.cpp
index 51ec657ccc9..9d5880abc13 100644
--- a/Spatial_searching/examples/Spatial_searching/distance_browsing.cpp
+++ b/Spatial_searching/examples/Spatial_searching/distance_browsing.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Orthogonal_incremental_neighbor_search.h>
 #include <CGAL/Search_traits_2.h>
@@ -40,18 +39,3 @@ int main() {
 
   return 0;
 }
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/Spatial_searching/examples/Spatial_searching/general_neighbor_searching.cpp b/Spatial_searching/examples/Spatial_searching/general_neighbor_searching.cpp
index 8eee31f9b82..c4a8b298930 100644
--- a/Spatial_searching/examples/Spatial_searching/general_neighbor_searching.cpp
+++ b/Spatial_searching/examples/Spatial_searching/general_neighbor_searching.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian_d.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/Manhattan_distance_iso_box_point.h>
diff --git a/Spatial_searching/examples/Spatial_searching/iso_rectangle_2_query.cpp b/Spatial_searching/examples/Spatial_searching/iso_rectangle_2_query.cpp
index 8ea471fc5f0..f95c9c5afeb 100644
--- a/Spatial_searching/examples/Spatial_searching/iso_rectangle_2_query.cpp
+++ b/Spatial_searching/examples/Spatial_searching/iso_rectangle_2_query.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Kd_tree.h>
 #include <CGAL/point_generators_2.h>
@@ -57,5 +56,3 @@ main() {
   std::cout << std::endl;
   return 0;
 }
-
-
diff --git a/Spatial_searching/examples/Spatial_searching/nearest_neighbor_searching.cpp b/Spatial_searching/examples/Spatial_searching/nearest_neighbor_searching.cpp
index bc4dd962ca9..68af9a5eb99 100644
--- a/Spatial_searching/examples/Spatial_searching/nearest_neighbor_searching.cpp
+++ b/Spatial_searching/examples/Spatial_searching/nearest_neighbor_searching.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/Orthogonal_k_neighbor_search.h>
diff --git a/Spatial_searching/examples/Spatial_searching/searching_with_circular_query.cpp b/Spatial_searching/examples/Spatial_searching/searching_with_circular_query.cpp
index df9c995c47b..abc2b5cc35a 100644
--- a/Spatial_searching/examples/Spatial_searching/searching_with_circular_query.cpp
+++ b/Spatial_searching/examples/Spatial_searching/searching_with_circular_query.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Kd_tree.h>
 #include <CGAL/Search_traits_2.h>
@@ -53,4 +52,3 @@ int main() {
   std::cout << "\ndone" << std::endl;
   return 0;
 }
-
diff --git a/Spatial_searching/examples/Spatial_searching/using_fair_splitting_rule.cpp b/Spatial_searching/examples/Spatial_searching/using_fair_splitting_rule.cpp
index e2a94ab9c57..f2a8b37fc4c 100644
--- a/Spatial_searching/examples/Spatial_searching/using_fair_splitting_rule.cpp
+++ b/Spatial_searching/examples/Spatial_searching/using_fair_splitting_rule.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/Search_traits_2.h>
diff --git a/Spatial_searching/examples/Spatial_searching/weighted_Minkowski_distance.cpp b/Spatial_searching/examples/Spatial_searching/weighted_Minkowski_distance.cpp
index 038a8afecba..54113e0924e 100644
--- a/Spatial_searching/examples/Spatial_searching/weighted_Minkowski_distance.cpp
+++ b/Spatial_searching/examples/Spatial_searching/weighted_Minkowski_distance.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Orthogonal_k_neighbor_search.h>
 #include <CGAL/Weighted_Minkowski_distance.h>
diff --git a/Spatial_sorting/examples/Spatial_sorting/sort_indices.cpp b/Spatial_sorting/examples/Spatial_sorting/sort_indices.cpp
index 847ff738c9a..3a40cab7b3e 100644
--- a/Spatial_sorting/examples/Spatial_sorting/sort_indices.cpp
+++ b/Spatial_sorting/examples/Spatial_sorting/sort_indices.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/spatial_sort.h>
 
diff --git a/Subdivision_method_3/examples/Subdivision_method_3/CatmullClark_subdivision.cpp b/Subdivision_method_3/examples/Subdivision_method_3/CatmullClark_subdivision.cpp
index acd3bc63287..2232b310982 100644
--- a/Subdivision_method_3/examples/Subdivision_method_3/CatmullClark_subdivision.cpp
+++ b/Subdivision_method_3/examples/Subdivision_method_3/CatmullClark_subdivision.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Subdivision_method_3.h>
 #include <iostream>
diff --git a/Subdivision_method_3/examples/Subdivision_method_3/Customized_subdivision.cpp b/Subdivision_method_3/examples/Subdivision_method_3/Customized_subdivision.cpp
index 99c7694ef6a..0e02e51940d 100644
--- a/Subdivision_method_3/examples/Subdivision_method_3/Customized_subdivision.cpp
+++ b/Subdivision_method_3/examples/Subdivision_method_3/Customized_subdivision.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Subdivision_method_3.h>
 
diff --git a/Subdivision_method_3/examples/Subdivision_method_3/DooSabin_subdivision.cpp b/Subdivision_method_3/examples/Subdivision_method_3/DooSabin_subdivision.cpp
index 95757346477..caec10dda71 100644
--- a/Subdivision_method_3/examples/Subdivision_method_3/DooSabin_subdivision.cpp
+++ b/Subdivision_method_3/examples/Subdivision_method_3/DooSabin_subdivision.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Subdivision_method_3.h>
 
diff --git a/Subdivision_method_3/examples/Subdivision_method_3/Loop_subdivision.cpp b/Subdivision_method_3/examples/Subdivision_method_3/Loop_subdivision.cpp
index bb95749390e..edbca6920d0 100644
--- a/Subdivision_method_3/examples/Subdivision_method_3/Loop_subdivision.cpp
+++ b/Subdivision_method_3/examples/Subdivision_method_3/Loop_subdivision.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Cartesian.h>
 #include <CGAL/Subdivision_method_3.h>
 
diff --git a/Triangulation_2/examples/Triangulation_2/adding_handles.cpp b/Triangulation_2/examples/Triangulation_2/adding_handles.cpp
index fd27bf1d106..f22184ba2d0 100644
--- a/Triangulation_2/examples/Triangulation_2/adding_handles.cpp
+++ b/Triangulation_2/examples/Triangulation_2/adding_handles.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Triangulation_2.h>
 #include <cassert>
diff --git a/Triangulation_2/examples/Triangulation_2/colored_face.cpp b/Triangulation_2/examples/Triangulation_2/colored_face.cpp
index f35c3bc4578..4dc6e0399cc 100644
--- a/Triangulation_2/examples/Triangulation_2/colored_face.cpp
+++ b/Triangulation_2/examples/Triangulation_2/colored_face.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/IO/Color.h>
 #include <CGAL/Triangulation_2.h>
diff --git a/Triangulation_2/examples/Triangulation_2/constrained.cpp b/Triangulation_2/examples/Triangulation_2/constrained.cpp
index 5eb1a52cce9..4880300d6c0 100644
--- a/Triangulation_2/examples/Triangulation_2/constrained.cpp
+++ b/Triangulation_2/examples/Triangulation_2/constrained.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 
@@ -31,4 +30,3 @@ main( )
   std::cout <<  count << std::endl;
   return 0;
 }
-
diff --git a/Triangulation_2/examples/Triangulation_2/constrained_hierarchy_plus.cpp b/Triangulation_2/examples/Triangulation_2/constrained_hierarchy_plus.cpp
index ed368a53c91..f65ace91c73 100644
--- a/Triangulation_2/examples/Triangulation_2/constrained_hierarchy_plus.cpp
+++ b/Triangulation_2/examples/Triangulation_2/constrained_hierarchy_plus.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 #include <CGAL/Triangulation_hierarchy_2.h>
diff --git a/Triangulation_2/examples/Triangulation_2/constrained_plus.cpp b/Triangulation_2/examples/Triangulation_2/constrained_plus.cpp
index 9eaa4bf426f..5d3614b6742 100644
--- a/Triangulation_2/examples/Triangulation_2/constrained_plus.cpp
+++ b/Triangulation_2/examples/Triangulation_2/constrained_plus.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 #include <CGAL/intersections.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
diff --git a/Triangulation_2/examples/Triangulation_2/hierarchy.cpp b/Triangulation_2/examples/Triangulation_2/hierarchy.cpp
index 5b7b24407e6..15a9414afce 100644
--- a/Triangulation_2/examples/Triangulation_2/hierarchy.cpp
+++ b/Triangulation_2/examples/Triangulation_2/hierarchy.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Delaunay_triangulation_2.h>
 #include <CGAL/Triangulation_hierarchy_2.h>
diff --git a/Triangulation_2/examples/Triangulation_2/regular.cpp b/Triangulation_2/examples/Triangulation_2/regular.cpp
index c534b349e77..111566e35f3 100644
--- a/Triangulation_2/examples/Triangulation_2/regular.cpp
+++ b/Triangulation_2/examples/Triangulation_2/regular.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Regular_triangulation_euclidean_traits_2.h>
 #include <CGAL/Regular_triangulation_filtered_traits_2.h>
diff --git a/Triangulation_2/examples/Triangulation_2/terrain.cpp b/Triangulation_2/examples/Triangulation_2/terrain.cpp
index 66736a66de4..80af08793a5 100644
--- a/Triangulation_2/examples/Triangulation_2/terrain.cpp
+++ b/Triangulation_2/examples/Triangulation_2/terrain.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Triangulation_euclidean_traits_xy_3.h>
 #include <CGAL/Delaunay_triangulation_2.h>
@@ -23,4 +22,3 @@ int main()
   std::cout << dt.number_of_vertices() << std::endl;
   return 0;
 }
-
diff --git a/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp b/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
index 7367e360aee..7684cebbb15 100644
--- a/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
+++ b/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
@@ -1,4 +1,3 @@
-
 #include <fstream>
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
diff --git a/Triangulation_2/examples/Triangulation_2/voronoi.cpp b/Triangulation_2/examples/Triangulation_2/voronoi.cpp
index 45e08af467e..a5cc7ad9b8a 100644
--- a/Triangulation_2/examples/Triangulation_2/voronoi.cpp
+++ b/Triangulation_2/examples/Triangulation_2/voronoi.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Delaunay_triangulation_2.h>
 
@@ -32,4 +31,3 @@ int main( )
 	    << " and " << nr << " rays" << std::endl;
   return 0;
 }
-
diff --git a/Triangulation_3/examples/Triangulation_3/adding_handles.cpp b/Triangulation_3/examples/Triangulation_3/adding_handles.cpp
index 007ff6251a0..91592697d08 100644
--- a/Triangulation_3/examples/Triangulation_3/adding_handles.cpp
+++ b/Triangulation_3/examples/Triangulation_3/adding_handles.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Delaunay_triangulation_3.h>
 #include <CGAL/Triangulation_vertex_base_3.h>
diff --git a/Triangulation_3/examples/Triangulation_3/color.cpp b/Triangulation_3/examples/Triangulation_3/color.cpp
index 65b3583a4cc..7bb190843b5 100644
--- a/Triangulation_3/examples/Triangulation_3/color.cpp
+++ b/Triangulation_3/examples/Triangulation_3/color.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Delaunay_triangulation_3.h>
 #include <CGAL/Triangulation_vertex_base_with_info_3.h>
diff --git a/Triangulation_3/examples/Triangulation_3/find_conflicts.cpp b/Triangulation_3/examples/Triangulation_3/find_conflicts.cpp
index 1d864aa20aa..60211a47bb3 100644
--- a/Triangulation_3/examples/Triangulation_3/find_conflicts.cpp
+++ b/Triangulation_3/examples/Triangulation_3/find_conflicts.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Delaunay_triangulation_3.h>
 #include <CGAL/point_generators_3.h>
diff --git a/Triangulation_3/examples/Triangulation_3/hierarchy.cpp b/Triangulation_3/examples/Triangulation_3/hierarchy.cpp
index 85fb82f1dc5..b4f298dd2da 100644
--- a/Triangulation_3/examples/Triangulation_3/hierarchy.cpp
+++ b/Triangulation_3/examples/Triangulation_3/hierarchy.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Delaunay_triangulation_3.h>
 #include <CGAL/Triangulation_hierarchy_3.h>
diff --git a/Triangulation_3/examples/Triangulation_3/linking_2d_and_3d.cpp b/Triangulation_3/examples/Triangulation_3/linking_2d_and_3d.cpp
index 7969dd6d5d0..f4e6b63a015 100644
--- a/Triangulation_3/examples/Triangulation_3/linking_2d_and_3d.cpp
+++ b/Triangulation_3/examples/Triangulation_3/linking_2d_and_3d.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Triangulation_data_structure_2.h>
 #include <CGAL/Triangulation_data_structure_3.h>
 #include <cassert>
diff --git a/Triangulation_3/examples/Triangulation_3/regular.cpp b/Triangulation_3/examples/Triangulation_3/regular.cpp
index 31d116e2ab6..ce15043785c 100644
--- a/Triangulation_3/examples/Triangulation_3/regular.cpp
+++ b/Triangulation_3/examples/Triangulation_3/regular.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Regular_triangulation_3.h>
 #include <CGAL/Regular_triangulation_euclidean_traits_3.h>
diff --git a/Triangulation_3/examples/Triangulation_3/tds.cpp b/Triangulation_3/examples/Triangulation_3/tds.cpp
index 3f8f8ff9946..2f3365ebe0d 100644
--- a/Triangulation_3/examples/Triangulation_3/tds.cpp
+++ b/Triangulation_3/examples/Triangulation_3/tds.cpp
@@ -1,4 +1,3 @@
-
 #include <CGAL/Triangulation_data_structure_3.h>
 #include <iostream>
 #include <fstream>
diff --git a/Width_3/examples/Width_3/width_simplex.cpp b/Width_3/examples/Width_3/width_simplex.cpp
index b80af0798f4..27ea1796b58 100644
--- a/Width_3/examples/Width_3/width_simplex.cpp
+++ b/Width_3/examples/Width_3/width_simplex.cpp
@@ -46,8 +46,3 @@ int main() {
               << simplex.get_number_of_optimal_solutions() << std::endl;
     return(0);
 }
-
-
-
-
-