Actually, the "// file: example_bla.cpp" lines are not needed anymore,

since the manual tools know it.  So let's just remove them (many were
not uptodate with the filemane anyway).

Alpha_shapes_2/examples/Alpha_shapes_2/alpha_shapes_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Alpha_shapes_2/example_alpha.cpp
 
 /***********************************************************************
 

Alpha_shapes_2/examples/Alpha_shapes_2/weighted_alpha_shapes_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Alpha_shapes_2/example_weight.cpp
 
 /***********************************************************************
 

Apollonius_graph_2/examples/Apollonius_graph_2/ag2_exact_traits.cpp

@@ -1,4 +1,3 @@
-// file: examples/Apollonius_graph_2/ag2_exact_traits.cpp
 
 #include <CGAL/basic.h>
 

Apollonius_graph_2/examples/Apollonius_graph_2/ag2_exact_traits_sqrt.cpp

@@ -1,4 +1,3 @@
-// file: examples/Apollonius_graph_2/ag2_exact_traits_sqrt.cpp
 
 #include <CGAL/basic.h>
 

Apollonius_graph_2/examples/Apollonius_graph_2/ag2_filtered_traits_no_hidden.cpp

@@ -1,4 +1,3 @@
-// file: examples/Apollonius_graph_2/ag2_filtered_traits_no_hidden.cpp
 
 #include <CGAL/basic.h>
 

Apollonius_graph_2/examples/Apollonius_graph_2/ag2_hierarchy.cpp

@@ -1,4 +1,3 @@
-// file: examples/Apollonius_graph_2/ag2_hierarchy.cpp
 
 #include <CGAL/basic.h>
 

Arrangement_2/examples/Arrangement_2/curve_history.cpp

@@ -1,4 +1,3 @@
-// file: examples/Arrangement_2/ex_curve_history.cpp
 // Constructing an arrangement with curve history.
 
 #include "arr_rational_nt.h"

Box_intersection_d/examples/Box_intersection_d/box_grid.cpp

@@ -1,4 +1,3 @@
-// file: examples/Box_intersection_d/box_grid.cpp
 #include <CGAL/box_intersection_d.h>
 #include <vector>
 #include <algorithm>

Box_intersection_d/examples/Box_intersection_d/custom_box_grid.cpp

@@ -1,4 +1,3 @@
-// file: examples/Box_intersection_d/custom_box_grid.cpp
 #include <CGAL/box_intersection_d.h>
 #include <vector>
 #include <algorithm>

Box_intersection_d/examples/Box_intersection_d/minimal.cpp

@@ -1,4 +1,3 @@
-// file: examples/Box_intersection_d/minimal.cpp
 #include <CGAL/box_intersection_d.h>
 #include <CGAL/Bbox_2.h>
 #include <iostream>

Box_intersection_d/examples/Box_intersection_d/minimal_self.cpp

@@ -1,4 +1,3 @@
-// file: examples/Box_intersection_d/minimal_self.cpp
 #include <CGAL/box_intersection_d.h>
 #include <CGAL/Bbox_2.h>
 #include <iostream>

Box_intersection_d/examples/Box_intersection_d/proximity_custom_box_traits.cpp

@@ -1,4 +1,3 @@
-// file: examples/Box_intersection_d/proximity_custom_box_traits.cpp
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/box_intersection_d.h>
 #include <CGAL/point_generators_3.h>

Box_intersection_d/examples/Box_intersection_d/triangle_self_intersect.cpp

@@ -1,4 +1,3 @@
-// file: examples/Box_intersection_d/triangle_self_intersect.cpp
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/intersections.h>
 #include <CGAL/point_generators_3.h>

Box_intersection_d/examples/Box_intersection_d/triangle_self_intersect_pointers.cpp

@@ -1,4 +1,3 @@
-// file: examples/Box_intersection_d/triangle_self_intersect_pointers.cpp
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/intersections.h>
 #include <CGAL/point_generators_3.h>

Circulator/examples/Circulator/circulator_prog1.cpp

@@ -1,4 +1,3 @@
-// file: examples/Circulator/circulator_prog1.cpp
 
 #include <CGAL/basic.h>
 #include <cassert>

Circulator/examples/Circulator/circulator_prog2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Circulator/circulator_prog2.cpp
 
 #include <CGAL/basic.h>
 #include <cassert>

Circulator/examples/Circulator/circulator_prog3.cpp

@@ -1,4 +1,3 @@
-// file: examples/Circulator/circulator_prog3.cpp
 
 #include <CGAL/basic.h>
 #include <cassert>

Convex_hull_2/examples/Convex_hull_2/ch_example_from_cin_to_cout.cpp

@@ -1,4 +1,3 @@
-// file: examples/Convex_hull_2/ch_example_from_cin_to_cout.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/ch_graham_andrew.h>

Convex_hull_2/examples/Convex_hull_2/ch_example_timing.cpp

@@ -1,4 +1,3 @@
-// file: examples/Convex_hull_2/ch_example_timing.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/convex_hull_traits_2.h>

Convex_hull_2/examples/Convex_hull_2/ch_graham_anderson.cpp

@@ -1,4 +1,3 @@
-// file: examples/Convex_hull_2/ch_graham_anderson.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/ch_graham_andrew.h>

Convex_hull_3/examples/Convex_hull_3/dynamic_hull_3.cpp

@@ -1,4 +1,3 @@
-// file: examples/Convex_hull_3/dynamic_hull_3_ex.cpp
 
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Filtered_kernel.h>

Convex_hull_3/examples/Convex_hull_3/incremental_hull_3.cpp

@@ -1,4 +1,3 @@
-// file: examples/Convex_hull_3/incremental_hull_3_ex.cpp
 
 #include <CGAL/Homogeneous.h>
 #include <CGAL/point_generators_3.h>

Convex_hull_3/examples/Convex_hull_3/quickhull_3.cpp

@@ -1,4 +1,3 @@
-// file: examples/Convex_hull_3/ch_quickhull_3_ex.cpp
 
 #include <CGAL/Homogeneous.h>
 #include <CGAL/point_generators_3.h>

Core/examples/Core/delaunay.cpp

@@ -1,4 +1,3 @@
-// file: examples/Core/delaunay.cpp
 
 #include <CGAL/basic.h>
 

Cubical_gaussian_map_3/examples/Cubical_gaussian_map_3/minksum_simple.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_simple.cpp
 
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Gmpq.h>

Generator/examples/Generator/random_convex_set.cpp

@@ -1,4 +1,3 @@
-// file: examples/Generator/rcs_example.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/point_generators_2.h>

Generator/examples/Generator/random_degenerate_point_set.cpp

@@ -1,4 +1,3 @@
-// file: examples/Generator/random_degenerate_point_set.cpp
 
 #include <CGAL/Simple_cartesian.h>
 #include <cassert>

Generator/examples/Generator/random_grid.cpp

@@ -1,4 +1,3 @@
-// file: examples/Generator/generators_example2.cpp
 
 #include <CGAL/Simple_cartesian.h>
 #include <cassert>

Generator/examples/Generator/random_polygon2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Generator/random_poly_example.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/point_generators_2.h>

Generator/examples/Generator/random_segments1.cpp

@@ -1,4 +1,3 @@
-// file: examples/Generator/Segment_generator_example1.cpp
 
 #include <CGAL/Simple_cartesian.h>
 #include <cassert>

Generator/examples/Generator/random_segments2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Generator/Segment_generator_example2.cpp
 
 // CGAL example program for the generic segment generator
 // using precomputed point locations.

HalfedgeDS/examples/HalfedgeDS/hds_prog_color.cpp

@@ -1,4 +1,3 @@
-// file: examples/HalfedgeDS/hds_prog_color.cpp
 
 #include <CGAL/HalfedgeDS_items_2.h>
 #include <CGAL/HalfedgeDS_default.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_compact.cpp

@@ -1,4 +1,3 @@
-// file: examples/HalfedgeDS/hds_prog_compact.cpp
 
 #include <CGAL/HalfedgeDS_items_2.h>
 #include <CGAL/HalfedgeDS_vector.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_compact2.cpp

@@ -1,4 +1,3 @@
-// file: examples/HalfedgeDS/hds_prog_compact2.cpp
 
 #include <CGAL/HalfedgeDS_items_2.h>
 #include <CGAL/HalfedgeDS_list.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_default.cpp

@@ -1,4 +1,3 @@
-// file: examples/HalfedgeDS/hds_prog_default.cpp
 
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_edge_iterator.cpp

@@ -1,4 +1,3 @@
-// file: examples/HalfedgeDS/hds_prog_edge_iterator.cpp
 
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_graph.cpp

@@ -1,4 +1,3 @@
-// file: examples/HalfedgeDS/hds_prog_graph.cpp
 
 #include <CGAL/HalfedgeDS_min_items.h>
 #include <CGAL/HalfedgeDS_default.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_graph2.cpp

@@ -1,4 +1,3 @@
-// file: examples/HalfedgeDS/hds_prog_graph2.cpp
 
 #include <CGAL/HalfedgeDS_min_items.h>
 #include <CGAL/HalfedgeDS_default.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_halfedge_iterator.cpp

@@ -1,4 +1,3 @@
-// file: examples/HalfedgeDS/hds_prog_halfedge_iterator.cpp
 
 #include <CGAL/HalfedgeDS_default.h>
 #include <CGAL/HalfedgeDS_decorator.h>

HalfedgeDS/examples/HalfedgeDS/hds_prog_vector.cpp

@@ -1,4 +1,3 @@
-// file: examples/HalfedgeDS/hds_prog_vector.cpp
 
 #include <CGAL/HalfedgeDS_items_2.h>
 #include <CGAL/HalfedgeDS_vector.h>

Interval_skip_list/examples/Interval_skip_list/intervals.cpp

@@ -1,4 +1,3 @@
-// file: examples/Interval_skip_list/intervals.cpp
 
 #include <CGAL/Interval_skip_list.h>
 #include <CGAL/Interval_skip_list_interval.h>

Interval_skip_list/examples/Interval_skip_list/terrain.cpp

@@ -1,4 +1,3 @@
-// file: examples/Interval_skip_list/terrain.cpp
 
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Delaunay_triangulation_2.h>

Kernel_23/examples/Kernel_23/MyKernel.cpp

@@ -1,4 +1,3 @@
-// file: examples/Kernel_23/MyKernel.cpp
 
 #include <CGAL/basic.h>
 #include <CGAL/Filtered_kernel.h>

Kernel_23/examples/Kernel_23/test_delaunay_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Kernel_23/test_delaunay_2.cpp
 
 // small example for compilation
 // check of Delaunay_triangulation_2 using the kernel concept

Kernel_23/examples/Kernel_23/test_polyhedron_prog_incr_builder.cpp

@@ -1,4 +1,3 @@
-// file: examples/Kernel_23/test_polyhedron_prog_incr_builder.cpp
 
 // original version see examples/Polyhedron/polyhedron_prog_incr_builder.cpp
 // this time we test compilation with the

Kernel_23/examples/Kernel_23/test_polyhedron_prog_incr_builder_own_archetype.cpp

@@ -1,4 +1,3 @@
-// file: examples/Kernel_23/test_polyhedron_prog_incr_builder_own_archetype.cpp
 
 // original version see examples/Polyhedron/polyhedron_prog_incr_builder.cpp
 // this time we test compilation with

Largest_empty_rect_2/examples/Largest_empty_rect_2/largest_empty_rectangle.cpp

@@ -1,4 +1,3 @@
-// file: examples/Largest_empty_rect_2/Largest_empty_rect_2.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/Iso_rectangle_2.h>

Matrix_search/examples/Matrix_search/all_furthest_neighbors_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Matrix_search/all_furthest_neighbors_2_example.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>

Matrix_search/examples/Matrix_search/rectangular_p_center_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Matrix_search/rectangular_p_center_2_example.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/point_generators_2.h>

Matrix_search/examples/Matrix_search/sorted_matrix_search.cpp

@@ -1,4 +1,3 @@
-// file: examples/Matrix_search/sorted_matrix_search_example.cpp
 
 #include <CGAL/Random.h>
 #include <CGAL/Cartesian_matrix.h>

Mesh_2/examples/Mesh_2/conforming.cpp

@@ -1,4 +1,3 @@
-// file: examples/Mesh_2/conforming.cpp
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>

Mesh_2/examples/Mesh_2/mesh_class.cpp

@@ -1,4 +1,3 @@
-// file: examples/Mesh_2/mesh_class.cpp
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>

Mesh_2/examples/Mesh_2/mesh_global.cpp

@@ -1,4 +1,3 @@
-// file: examples/Mesh_2/mesh_global.cpp
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>

Mesh_2/examples/Mesh_2/mesh_with_seeds.cpp

@@ -1,4 +1,3 @@
-// file: examples/Mesh_2/mesh_with_seeds.cpp
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>

Min_annulus_d/examples/Min_annulus_d/min_annulus_d.cpp

@@ -1,4 +1,3 @@
-// file: examples/Min_annulus_d/min_annulus_d.cpp
 
 // computes the smallest enclosing annulus of two point
 // sets on nested squares in R^2, using double

Min_annulus_d/examples/Min_annulus_d/min_annulus_d_fast_exact.cpp

@@ -1,4 +1,3 @@
-// file: examples/Min_annulus_d/min_annulus_d_fast_exact.cpp
 
 // computes the smallest enclosing annulus of two point
 // sets on nested squares in R^2,  using double

Min_circle_2/examples/Min_circle_2/min_circle_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Min_circle_2/min_circle_2.cpp
 
 // includes
 #include <CGAL/Homogeneous.h>

Min_ellipse_2/examples/Min_ellipse_2/min_ellipse_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Min_ellipse_2/min_ellipse_2.cpp
 
 // includes
 #include <cassert>

Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Min_quadrilateral_2/minimum_enclosing_parallelogram_2.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>

Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Min_quadrilateral_2/minimum_enclosing_rectangle_2.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>

Min_quadrilateral_2/examples/Min_quadrilateral_2/minimum_enclosing_strip_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Min_quadrilateral_2/minimum_enclosing_strip_2.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>

Min_sphere_d/examples/Min_sphere_d/min_sphere_d.cpp

@@ -1,4 +1,3 @@
-// file: examples/Min_sphere_d/min_sphere_d.cpp
 
 #include <CGAL/Cartesian_d.h>
 #include <iostream>

Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/benchmark.cpp

@@ -1,4 +1,3 @@
-// file: examples/Min_sphere_of_spheres_d/benchmark.cpp
 
 #include <iostream>
 #include <ctime>

Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_example_2.cpp
 
 // Computes the minsphere of some random spheres.
 // This example illustrates how to use CGAL::Point_2 and CGAL::

Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_3.cpp

@@ -1,4 +1,3 @@
-// file: examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_example_3.cpp
 
 // Computes the minsphere of some random spheres.
 // This example illustrates how to use CGAL::Point_3 and CGAL::

Min_sphere_of_spheres_d/examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_d.cpp

@@ -1,4 +1,3 @@
-// file: examples/Min_sphere_of_spheres_d/min_sphere_of_spheres_d_example_d.cpp
 
 // Computes the minsphere of some random spheres.
 // This example illustrates how to use CGAL::Point_d and CGAL::

Nef_3/examples/Nef_3/complex_construction.cpp

@@ -1,4 +1,3 @@
-// file: examples/Nef_3/complex_construction.cpp
 
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>

Nef_3/examples/Nef_3/construction.cpp

@@ -1,4 +1,3 @@
-// file: examples/Nef_3/construction.cpp
 
 #include <CGAL/Gmpz.h>
 #include <CGAL/Extended_homogeneous.h>

Nef_3/examples/Nef_3/exploration_SM.cpp

@@ -1,4 +1,3 @@
-// file: examples/Nef_3/exploration_SM.cpp
 
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>

Nef_3/examples/Nef_3/extended_kernel.cpp

@@ -1,4 +1,3 @@
-// file: examples/Nef_3/extended_kernel.cpp
 
 #include <CGAL/Gmpz.h>
 #include <CGAL/Extended_homogeneous.h>

Nef_3/examples/Nef_3/interface_polyhedron.cpp

@@ -1,4 +1,3 @@
-// file: examples/Nef_3/interface_polyhedron.cpp
 
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>

Nef_3/examples/Nef_3/nefIO.cpp

@@ -1,4 +1,3 @@
-// file: examples/Nef_3/nefIO.cpp
 
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>

Nef_3/examples/Nef_3/point_location.cpp

@@ -1,4 +1,3 @@
-// file: examples/Nef_3/point_location.cpp
 
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>

Nef_3/examples/Nef_3/point_set_operations.cpp

@@ -1,4 +1,3 @@
-// file: examples/Nef_3/point_set_operations.cpp
 
 #include <CGAL/Gmpz.h>
 #include <CGAL/Extended_homogeneous.h>

Nef_3/examples/Nef_3/shell_exploration.cpp

@@ -1,4 +1,3 @@
-// file: examples/Nef_3/shell_exploration.cpp
 
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>

Nef_3/examples/Nef_3/simple.cpp

@@ -1,4 +1,3 @@
-// file: examples/Nef_3/simple.cpp
 
 #include <CGAL/Gmpz.h>
 #include <CGAL/Homogeneous.h>

Partition_2/examples/Partition_2/approx_convex_partition_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Partition_2/approx_convex_partition.cpp
 
 #include <CGAL/basic.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>

Partition_2/examples/Partition_2/greene_approx_convex_partition_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Partition_2/greene_approx_convex_partition_2.cpp
 
 #include <CGAL/basic.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>

Partition_2/examples/Partition_2/optimal_convex_partition_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Partition_2/optimal_convex_partition_2.cpp
 
 #include <CGAL/basic.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>

Partition_2/examples/Partition_2/y_monotone_partition_2.cpp

@@ -1,4 +1,3 @@
-// file: examples/Partition_2/y_monotone_partition_2.cpp
 
 #include <CGAL/basic.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>

Point_set_2/examples/Point_set_2/nearest_neighbor.cpp

@@ -1,4 +1,3 @@
-// file: examples/Point_set_2/nearest_neighbors.cpp
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Point_set_2.h>

Point_set_2/examples/Point_set_2/range_search.cpp

@@ -1,4 +1,3 @@
-// file: examples/Point_set_2/range_search.cpp
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Point_set_2.h>

Polygon/examples/Polygon/Example.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polygon/Example.cpp
 
 //-----------------------------------------------------------------------//
 // This is just a simple example that demonstrates how to use the

Polygon/examples/Polygon/Polygon.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polygon/Polygon.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2.h>

Polygon/examples/Polygon/polygon_algorithms.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polygon/polygon_algorithms.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polygon_2_algorithms.h>

Polyhedron/examples/Polyhedron/polyhedron_prog_color.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_color.cpp
 
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/IO/Color.h>

Polyhedron/examples/Polyhedron/polyhedron_prog_cube.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_cube.cpp
 
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polyhedron_3.h>

Polyhedron/examples/Polyhedron/polyhedron_prog_incr_builder.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_incr_builder.cpp
 
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polyhedron_incremental_builder_3.h>

Polyhedron/examples/Polyhedron/polyhedron_prog_normals.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_normals.cpp
 
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Polyhedron_traits_with_normals_3.h>

Polyhedron/examples/Polyhedron/polyhedron_prog_off.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_off.cpp
 
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polyhedron_3.h>

Polyhedron/examples/Polyhedron/polyhedron_prog_planes.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_planes.cpp
 
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Polyhedron_3.h>

Polyhedron/examples/Polyhedron/polyhedron_prog_simple.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_simple.cpp
 
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polyhedron_3.h>

Polyhedron/examples/Polyhedron/polyhedron_prog_subdiv.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_subdiv.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polyhedron_3.h>

Polyhedron/examples/Polyhedron/polyhedron_prog_subdiv_with_boundary.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_subdiv_with_boundary.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polyhedron_3.h>

Polyhedron/examples/Polyhedron/polyhedron_prog_tetra.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_tetra.cpp
 
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polyhedron_3.h>

Polyhedron/examples/Polyhedron/polyhedron_prog_traits.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_traits.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/Polyhedron_traits_3.h>

Polyhedron/examples/Polyhedron/polyhedron_prog_vector.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron/polyhedron_prog_vector.cpp
 
 #include <CGAL/Cartesian.h>
 #include <CGAL/HalfedgeDS_vector.h>

Polyhedron/examples/Polyhedron/polyhedron_self_intersection.cpp

@@ -1,4 +1,3 @@
-// file: examples/intersection.cpp
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Polyhedron_3.h>

Polyhedron_IO/examples/Polyhedron_IO/iv2off.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron_IO/iv2off.cpp
 
 // Converts Geometry Information in Inventor files (*.iv) into OFF format. 
 // The scanner triggers on Coordinate3, IndexedFaceSet, and IndexedLineSet

Polyhedron_IO/examples/Polyhedron_IO/off2iv.cpp

@@ -1,4 +1,3 @@
-// file: examples/Polyhedron_IO/off2iv.cpp
 
 // Convert from OFF format to OpenInventor (.iv) format.