From 599d68cd916f533bdb66dd9e684dd5703233b6bb Mon Sep 17 00:00:00 2001 From: Gard Spreemann Date: Wed, 25 Sep 2019 14:29:41 +0200 Subject: Delete all files in order to incorporate upstream's move to git. --- example/Spatial_searching/CMakeLists.txt | 9 ---- .../example_spatial_searching.cpp | 60 ---------------------- 2 files changed, 69 deletions(-) delete mode 100644 example/Spatial_searching/CMakeLists.txt delete mode 100644 example/Spatial_searching/example_spatial_searching.cpp (limited to 'example/Spatial_searching') diff --git a/example/Spatial_searching/CMakeLists.txt b/example/Spatial_searching/CMakeLists.txt deleted file mode 100644 index 0f799987..00000000 --- a/example/Spatial_searching/CMakeLists.txt +++ /dev/null @@ -1,9 +0,0 @@ -project(Spatial_searching_examples) - -if(NOT CGAL_WITH_EIGEN3_VERSION VERSION_LESS 4.8.1) - add_executable( Spatial_searching_example_spatial_searching example_spatial_searching.cpp ) - target_link_libraries(Spatial_searching_example_spatial_searching ${CGAL_LIBRARY}) - add_test(NAME Spatial_searching_example_spatial_searching - COMMAND $) - install(TARGETS Spatial_searching_example_spatial_searching DESTINATION bin) -endif(NOT CGAL_WITH_EIGEN3_VERSION VERSION_LESS 4.8.1) diff --git a/example/Spatial_searching/example_spatial_searching.cpp b/example/Spatial_searching/example_spatial_searching.cpp deleted file mode 100644 index 034ad24a..00000000 --- a/example/Spatial_searching/example_spatial_searching.cpp +++ /dev/null @@ -1,60 +0,0 @@ -#include - -#include -#include - -#include - -namespace gss = Gudhi::spatial_searching; - -int main(void) { - typedef CGAL::Epick_d > K; - typedef typename K::Point_d Point; - typedef std::vector Points; - - typedef gss::Kd_tree_search 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 knn_range = points_ds.k_nearest_neighbors(points[20], 10, true); - for (auto const& nghb : knn_range) - std::cout << nghb.first << " (sq. dist. = " << nghb.second << ")\n"; - - // Incremental nearest neighbor query - std::cout << "Incremental nearest neighbors:\n"; - auto inn_range = points_ds.incremental_nearest_neighbors(points[45]); - // Get the neighbors in distance order until we hit the first point - for (auto ins_iterator = inn_range.begin(); ins_iterator->first != 0; ++ins_iterator) - std::cout << ins_iterator->first << " (sq. dist. = " << ins_iterator->second << ")\n"; - - // 10-furthest neighbor query - std::cout << "10 furthest neighbors from points[20]:\n"; - auto kfn_range = points_ds.k_furthest_neighbors(points[20], 10, true); - for (auto const& nghb : kfn_range) - std::cout << nghb.first << " (sq. dist. = " << nghb.second << ")\n"; - - // Incremental furthest neighbor query - std::cout << "Incremental furthest neighbors:\n"; - auto ifn_range = points_ds.incremental_furthest_neighbors(points[45]); - // Get the neighbors in distance reverse order until we hit the first point - for (auto ifs_iterator = ifn_range.begin(); ifs_iterator->first != 0; ++ifs_iterator) - std::cout << ifs_iterator->first << " (sq. dist. = " << ifs_iterator->second << ")\n"; - - // All-near-neighbors search - std::cout << "All-near-neighbors search:\n"; - std::vector rs_result; - points_ds.all_near_neighbors(points[45], 0.5, std::back_inserter(rs_result)); - K k; - for (auto const& p_idx : rs_result) - std::cout << p_idx << " (sq. dist. = " << k.squared_distance_d_object()(points[p_idx], points[45]) << ")\n"; - - return 0; -} -- cgit v1.2.3