2 files changed, 78 insertions, 0 deletions
diff --git a/src/Spatial_searching/example/CMakeLists.txt b/src/Spatial_searching/example/CMakeLists.txt
new file mode 100644
index 00000000..0885c24c
--- /dev/null
+++ b/src/Spatial_searching/example/CMakeLists.txt
@@ -0,0 +1,24 @@
+cmake_minimum_required(VERSION 2.6)
+project(Spatial_searching_examples)
+
+if(CGAL_FOUND)
+  if (NOT CGAL_VERSION VERSION_LESS 4.8.0)
+    message(STATUS "CGAL version: ${CGAL_VERSION}.")
+
+    find_package(Eigen3 3.1.0)
+    if (EIGEN3_FOUND)
+      message(STATUS "Eigen3 version: ${EIGEN3_VERSION}.")
+      include( ${EIGEN3_USE_FILE} )
+      include_directories (BEFORE "../../include")
+
+      add_executable( Spatial_searching_example_spatial_searching example_spatial_searching.cpp )
+      target_link_libraries(Spatial_searching_example_spatial_searching ${CGAL_LIBRARY})
+    else()
+      message(WARNING "Eigen3 not found. Version 3.1.0 is required for the Tangential_complex examples.")
+    endif()
+  else()
+    message(WARNING "CGAL version: ${CGAL_VERSION} is too old to compile Spatial_searching examples. Version 4.8.0 is required.")
+  endif ()
+else()
+  message(WARNING "CGAL not found. It is required for the Spatial_searching examples.")
+endif()
diff --git a/src/Spatial_searching/example/example_spatial_searching.cpp b/src/Spatial_searching/example/example_spatial_searching.cpp
new file mode 100644
index 00000000..ba2ea25f
--- /dev/null
+++ b/src/Spatial_searching/example/example_spatial_searching.cpp
@@ -0,0 +1,54 @@
+#include <gudhi/Spatial_tree_data_structure.h>
+
+#include <CGAL/Epick_d.h>
+#include <CGAL/Random.h>
+
+#include <vector>
+
+namespace gss = Gudhi::spatial_searching;
+
+int main (void)
+{
+  typedef CGAL::Epick_d<CGAL::Dimension_tag<4> >      K;
+  typedef typename K::FT                              FT;
+  typedef typename K::Point_d                         Point;
+  typedef std::vector<Point>                          Points;
+
+  typedef gss::Spatial_tree_data_structure<K, Points> Points_ds;
+
+  CGAL::Random rd;
+
+  Points points;
+  for (int i = 0; i < 500; ++i)
+    points.push_back(Point(rd.get_double(-1.,1), rd.get_double(-1.,1), rd.get_double(-1.,1), rd.get_double(-1.,1)));
+
+  Points_ds points_ds(points);
+
+  // 10-nearest neighbor query
+  std::cout << "10 nearest neighbors from points[20]:\n";
+  auto kns_range = points_ds.query_k_nearest_neighbors(points[20], 10, true);
+  for (auto const& nghb : kns_range)
+    std::cout << nghb.first << " (sq. dist. = " << nghb.second << ")\n";
+
+  // Incremental nearest neighbor query
+  std::cout << "Incremental nearest neighbors:\n";
+  auto ins_range = points_ds.query_incremental_nearest_neighbors(points[45]);
+  // Get all the neighbors that are closer than 0.5
+  for (auto ins_iterator = ins_range.begin(); ins_iterator->second < 0.5*0.5 ; ++ins_iterator)
+    std::cout << ins_iterator->first << " (sq. dist. = " << ins_iterator->second << ")\n";
+
+  // 10-farthest neighbor query
+  std::cout << "10 farthest neighbors from points[20]:\n";
+  auto kfs_range = points_ds.query_k_farthest_neighbors(points[20], 10, true);
+  for (auto const& nghb : kfs_range)
+    std::cout << nghb.first << " (sq. dist. = " << nghb.second << ")\n";
+
+  // Incremental farthest neighbor query
+  std::cout << "Incremental farthest neighbors:\n";
+  auto ifs_range = points_ds.query_incremental_farthest_neighbors(points[45]);
+  // Get all the neighbors that are farthest than 2.3
+  for (auto ifs_iterator = ifs_range.begin(); ifs_iterator->second > 2.3*2.3 ; ++ifs_iterator)
+    std::cout << ifs_iterator->first << " (sq. dist. = " << ifs_iterator->second << ")\n";
+  
+  return 0;
+}