Replace tabs with spaces and remove trailing whitespaces

.travis/generate_travis.sh

@@ -21,7 +21,7 @@ for f in *
 do
   if [ -d  "$f/package_info/$f" ]
 	then
-  	echo "$f " >> ./tmp.txt
+	echo "$f" >> ./tmp.txt
 	fi
 done
         LC_ALL=C sort ./tmp.txt > ./.travis/packages.txt

.travis/packages.txt

@@ -1,138 +1,138 @@
-AABB_tree 
-Advancing_front_surface_reconstruction 
-Algebraic_foundations 
-Algebraic_kernel_d 
-Algebraic_kernel_for_circles 
-Algebraic_kernel_for_spheres 
-Alpha_shapes_2 
-Alpha_shapes_3 
-Apollonius_graph_2 
-Arithmetic_kernel 
-Arrangement_on_surface_2 
-BGL 
-Barycentric_coordinates_2 
-Boolean_set_operations_2 
-Bounding_volumes 
-Box_intersection_d 
-CGAL_Core 
-CGAL_ImageIO 
-CGAL_ipelets 
-Cartesian_kernel 
-Circular_kernel_2 
-Circular_kernel_3 
-Circulator 
-Classification 
-Combinatorial_map 
-Cone_spanners_2 
-Convex_decomposition_3 
-Convex_hull_2 
-Convex_hull_3 
-Convex_hull_d 
-Distance_2 
-Distance_3 
-Envelope_2 
-Envelope_3 
-Filtered_kernel 
-Generalized_map 
-Generator 
-Geomview 
-GraphicsView 
-HalfedgeDS 
-Hash_map 
-Heat_method_3 
-Homogeneous_kernel 
-Hyperbolic_triangulation_2 
-Inscribed_areas 
-Installation 
-Interpolation 
-Intersections_2 
-Intersections_3 
-Interval_skip_list 
-Interval_support 
-Inventor 
-Jet_fitting_3 
-Kernel_23 
-Kernel_d 
-LEDA 
-Linear_cell_complex 
-MacOSX 
-Maintenance 
-Matrix_search 
-Mesh_2 
-Mesh_3 
-Mesher_level 
-Minkowski_sum_2 
-Minkowski_sum_3 
-Modifier 
-Modular_arithmetic 
-Nef_2 
-Nef_3 
-Nef_S2 
-NewKernel_d 
-Number_types 
-OpenNL 
-Optimal_transportation_reconstruction_2 
-Optimisation_basic 
-Partition_2 
-Periodic_2_triangulation_2 
-Periodic_3_mesh_3 
-Periodic_3_triangulation_3 
-Periodic_4_hyperbolic_triangulation_2 
-Point_set_2 
-Point_set_3 
-Point_set_processing_3 
-Poisson_surface_reconstruction_3 
-Polygon 
-Polygon_mesh_processing 
-Polygonal_surface_reconstruction 
-Polyhedron 
-Polyhedron_IO 
-Polyline_simplification_2 
-Polynomial 
-Polytope_distance_d 
-Principal_component_analysis 
-Principal_component_analysis_LGPL 
-Profiling_tools 
-Property_map 
-QP_solver 
-Random_numbers 
-Ridges_3 
-STL_Extension 
-Scale_space_reconstruction_3 
-Scripts 
-SearchStructures 
-Segment_Delaunay_graph_2 
-Segment_Delaunay_graph_Linf_2 
-Set_movable_separability_2 
-Shape_detection 
-Skin_surface_3 
-Snap_rounding_2 
-Solver_interface 
-Spatial_searching 
-Spatial_sorting 
-Straight_skeleton_2 
-Stream_lines_2 
-Stream_support 
-Subdivision_method_3 
-Surface_mesh 
-Surface_mesh_approximation 
-Surface_mesh_deformation 
-Surface_mesh_parameterization 
-Surface_mesh_segmentation 
-Surface_mesh_shortest_path 
-Surface_mesh_simplification 
-Surface_mesh_skeletonization 
-Surface_mesh_topology 
-Surface_mesher 
-Surface_sweep_2 
-TDS_2 
-TDS_3 
-Testsuite 
-Three 
-Triangulation 
-Triangulation_2 
-Triangulation_3 
-Union_find 
-Visibility_2 
-Voronoi_diagram_2 
-wininst 
+AABB_tree
+Advancing_front_surface_reconstruction
+Algebraic_foundations
+Algebraic_kernel_d
+Algebraic_kernel_for_circles
+Algebraic_kernel_for_spheres
+Alpha_shapes_2
+Alpha_shapes_3
+Apollonius_graph_2
+Arithmetic_kernel
+Arrangement_on_surface_2
+BGL
+Barycentric_coordinates_2
+Boolean_set_operations_2
+Bounding_volumes
+Box_intersection_d
+CGAL_Core
+CGAL_ImageIO
+CGAL_ipelets
+Cartesian_kernel
+Circular_kernel_2
+Circular_kernel_3
+Circulator
+Classification
+Combinatorial_map
+Cone_spanners_2
+Convex_decomposition_3
+Convex_hull_2
+Convex_hull_3
+Convex_hull_d
+Distance_2
+Distance_3
+Envelope_2
+Envelope_3
+Filtered_kernel
+Generalized_map
+Generator
+Geomview
+GraphicsView
+HalfedgeDS
+Hash_map
+Heat_method_3
+Homogeneous_kernel
+Hyperbolic_triangulation_2
+Inscribed_areas
+Installation
+Interpolation
+Intersections_2
+Intersections_3
+Interval_skip_list
+Interval_support
+Inventor
+Jet_fitting_3
+Kernel_23
+Kernel_d
+LEDA
+Linear_cell_complex
+MacOSX
+Maintenance
+Matrix_search
+Mesh_2
+Mesh_3
+Mesher_level
+Minkowski_sum_2
+Minkowski_sum_3
+Modifier
+Modular_arithmetic
+Nef_2
+Nef_3
+Nef_S2
+NewKernel_d
+Number_types
+OpenNL
+Optimal_transportation_reconstruction_2
+Optimisation_basic
+Partition_2
+Periodic_2_triangulation_2
+Periodic_3_mesh_3
+Periodic_3_triangulation_3
+Periodic_4_hyperbolic_triangulation_2
+Point_set_2
+Point_set_3
+Point_set_processing_3
+Poisson_surface_reconstruction_3
+Polygon
+Polygon_mesh_processing
+Polygonal_surface_reconstruction
+Polyhedron
+Polyhedron_IO
+Polyline_simplification_2
+Polynomial
+Polytope_distance_d
+Principal_component_analysis
+Principal_component_analysis_LGPL
+Profiling_tools
+Property_map
+QP_solver
+Random_numbers
+Ridges_3
+STL_Extension
+Scale_space_reconstruction_3
+Scripts
+SearchStructures
+Segment_Delaunay_graph_2
+Segment_Delaunay_graph_Linf_2
+Set_movable_separability_2
+Shape_detection
+Skin_surface_3
+Snap_rounding_2
+Solver_interface
+Spatial_searching
+Spatial_sorting
+Straight_skeleton_2
+Stream_lines_2
+Stream_support
+Subdivision_method_3
+Surface_mesh
+Surface_mesh_approximation
+Surface_mesh_deformation
+Surface_mesh_parameterization
+Surface_mesh_segmentation
+Surface_mesh_shortest_path
+Surface_mesh_simplification
+Surface_mesh_skeletonization
+Surface_mesh_topology
+Surface_mesher
+Surface_sweep_2
+TDS_2
+TDS_3
+Testsuite
+Three
+Triangulation
+Triangulation_2
+Triangulation_3
+Union_find
+Visibility_2
+Voronoi_diagram_2
+wininst

AABB_tree/benchmark/AABB_tree/CMakeLists.txt

@@ -10,7 +10,7 @@ if ( CGAL_FOUND )
   include( ${CGAL_USE_FILE} )
 else ()
   message(STATUS "This project requires the CGAL library, and will not be compiled.")
-  return()  
+  return()
 
 endif()
 
@@ -20,7 +20,7 @@ find_package( Boost REQUIRED )
 # include for local directory
 if ( NOT Boost_FOUND )
   message(STATUS "This project requires the Boost library, and will not be compiled.")
-  return()  
+  return()
 endif()
 
 # include for local package

AABB_tree/benchmark/AABB_tree/test.cpp

@@ -39,7 +39,7 @@ void naive_test(int k, const char* fname,
   CGAL::Aff_transformation_3<K> init2(CGAL::TRANSLATION, - K::Vector_3(
                                         (box.xmax()-box.xmin()),0,0));
   PMP::transform(init2, tm2);
-  
+
   tmTree.build();
   K::Vector_3 unit_vec = (2.0/k * K::Vector_3((box.xmax()-box.xmin()),
                                               0,
@@ -56,9 +56,9 @@ void naive_test(int k, const char* fname,
   rot[7] = std::sin(CGAL_PI/4.0);
   rot[8] = std::cos(CGAL_PI/4.0);
   CGAL::Aff_transformation_3<K> R(rot[0], rot[1], rot[2],
-      rot[3], rot[4], rot[5], 
+      rot[3], rot[4], rot[5],
       rot[6], rot[7], rot[8]);
-  
+
   CGAL::Side_of_triangle_mesh<Surface_mesh, K> sotm1(tm);
   for(int i=1; i<k+1; ++i)
   {
@@ -68,10 +68,10 @@ void naive_test(int k, const char* fname,
     tmTree2.build();
     if(tmTree2.do_intersect(tmTree))
       ++nb_inter;
-    else 
+    else
     {
       if(sotm1(tm2.point(*tm2.vertices().begin())) != CGAL::ON_UNBOUNDED_SIDE)
-      {        
+      {
         ++nb_include;
       }
       else
@@ -101,16 +101,16 @@ void test_no_collision(int k, const char* fname,
   CGAL::Aff_transformation_3<K> init2(CGAL::TRANSLATION, - K::Vector_3(
                                         (box.xmax()-box.xmin()),0,0));
   PMP::transform(init2, tm2);
-  
+
   tmTree.build();
   tmTree2.build();
   typedef boost::property_map<Surface_mesh, CGAL::vertex_point_t>::type VPM;
   VPM vpm2 = get(CGAL::vertex_point, tm2);
-  
+
   K::Vector_3 unit_vec = (2.0/k * K::Vector_3((box.xmax()-box.xmin()),
                                               0,
                                               0));
-  
+
   CGAL::Side_of_triangle_mesh<Surface_mesh, K,
       VPM, Tree> sotm1(tmTree);
   for(int i=1; i<k+1; ++i)
@@ -126,18 +126,18 @@ void test_no_collision(int k, const char* fname,
     rot[7] = std::sin(i*CGAL_PI/4.0);
     rot[8] = std::cos(i*CGAL_PI/4.0);
     CGAL::Aff_transformation_3<K> R(rot[0], rot[1], rot[2],
-        rot[3], rot[4], rot[5], 
+        rot[3], rot[4], rot[5],
         rot[6], rot[7], rot[8]);
     CGAL::Aff_transformation_3<K> T1 = CGAL::Aff_transformation_3<K>(CGAL::TRANSLATION, i*unit_vec);
     CGAL::Aff_transformation_3<K> transfo = R*T1;
     tmTree2.traits().set_transformation(transfo);
     CGAL::Interval_nt_advanced::Protector protector;
     if(tmTree2.do_intersect(tmTree))
       ++nb_inter;
-    else 
+    else
     {
       if(sotm1(transfo.transform(vpm2[*tm2.vertices().begin()])) != CGAL::ON_UNBOUNDED_SIDE)
-      {        
+      {
         ++nb_include;
       }
       else
@@ -158,7 +158,7 @@ int main(int argc, const char** argv)
   int k = (argc>1) ? atoi(argv[1]) : 10;
   const char* path = (argc>2)?argv[2]:"data/handle"
                                       ".off";
- 
+
   std::cout<< k<<" steps in "<<path<<std::endl;
   int nb_inter(0), nb_no_inter(0), nb_include(0),
       naive_inter(0), naive_no_inter(0), naive_include(0);

AABB_tree/demo/AABB_tree/CMakeLists.txt

@@ -46,7 +46,7 @@ if(CGAL_FOUND AND CGAL_Qt5_FOUND AND Qt5_FOUND)
                                        "${CMAKE_CURRENT_BINARY_DIR}/Viewer_moc.cpp"
                                        "${CMAKE_CURRENT_BINARY_DIR}/Scene_moc.cpp" )
 
-  add_executable  ( AABB_demo AABB_demo.cpp ${UI_FILES} ${CGAL_Qt5_RESOURCE_FILES} 
+  add_executable  ( AABB_demo AABB_demo.cpp ${UI_FILES} ${CGAL_Qt5_RESOURCE_FILES}
     #${CGAL_Qt5_MOC_FILES}
     )
   # Link with Qt libraries