Add simple benchmark

Author: lrineau

Spatial_sorting/benchmark/Spatial_sorting/CMakeLists.txt

@@ -0,0 +1,33 @@
+# Created by the script cgal_create_cmake_script
+# This is the CMake script for compiling a CGAL application.
+
+
+project( Spatial_sorting_ )
+
+cmake_minimum_required(VERSION 2.6.2)
+if("${CMAKE_MAJOR_VERSION}.${CMAKE_MINOR_VERSION}" VERSION_GREATER 2.6)
+  if("${CMAKE_MAJOR_VERSION}.${CMAKE_MINOR_VERSION}.${CMAKE_PATCH_VERSION}" VERSION_GREATER 2.8.3)
+    cmake_policy(VERSION 2.8.4)
+  else()
+    cmake_policy(VERSION 2.6)
+  endif()
+endif()
+
+find_package(CGAL QUIET COMPONENTS Core )
+
+if ( CGAL_FOUND )
+
+  include( ${CGAL_USE_FILE} )
+
+  include( CGAL_CreateSingleSourceCGALProgram )
+
+  include_directories (BEFORE "../../include")
+
+  create_single_source_cgal_program( "simple.cpp" )
+
+else()
+  
+    message(STATUS "This program requires the CGAL library, and will not be compiled.")
+  
+endif()
+

Spatial_sorting/benchmark/Spatial_sorting/simple.cpp

@@ -0,0 +1,40 @@
+//#define CGAL_PROFILE
+//#define CGAL_USE_SSE2_FABS
+//#define CGAL_USE_SSE2_MAX
+//#define CGAL_MSVC_USE_STD_FABS  // use this one with precise 
+#define CGAL_DONT_USE_INDEPENDENT_SHUFFLE 1
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
+
+#include <CGAL/Delaunay_triangulation_3.h>
+
+
+#include <CGAL/Timer.h>
+#include <iostream>
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel  K;
+typedef CGAL::Delaunay_triangulation_3<K> DT;
+typedef K::Point_3 Point_3;
+typedef CGAL::Timer Timer;
+
+int main()
+{
+
+  std::vector<Point_3> points;
+  Point_3 p;
+
+  while(std::cin >> p){
+    points.push_back(p);
+  }
+  Timer timer;
+  timer.start();
+  int N = 0;
+  for(int i = 0; i < 5; i++){
+    spatial_sort(points.begin(), points.end());
+  }
+  timer.stop();
+  
+  std::cerr << timer.time() << " sec" << std::endl;
+  return 0;
+}

Spatial_sorting/dont_submit

@@ -0,0 +1 @@
+benchmark