Merge branch 'dfsg/latest' into debian/sid

1 files changed, 81 insertions, 0 deletions

diff --git a/src/Nerve_GIC/test/test_GIC.cpp b/src/Nerve_GIC/test/test_GIC.cpp
new file mode 100644
index 00000000..9d326234
--- /dev/null
+++ b/src/Nerve_GIC/test/test_GIC.cpp
@@ -0,0 +1,81 @@
+/*    This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
+ *    See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
+ *    Author(s):       Mathieu Carrière
+ *
+ *    Copyright (C) 2017 Inria
+ *
+ *    Modification(s):
+ *      - YYYY/MM Author: Description of the modification
+ */
+
+#define BOOST_TEST_DYN_LINK
+#define BOOST_TEST_MODULE "graph_induced_complex"
+
+#include <boost/test/unit_test.hpp>
+
+#include <limits>
+#include <string>
+#include <vector>
+
+#include <gudhi/GIC.h>
+#include <gudhi/distance_functions.h>
+#include <gudhi/reader_utils.h>
+
+BOOST_AUTO_TEST_CASE(check_nerve) {
+  using Point = std::vector<float>;
+  Gudhi::cover_complex::Cover_complex<Point> N;
+  N.set_type("Nerve");
+  std::string cloud_file_name("data/cloud");
+  N.read_point_cloud(cloud_file_name);
+  N.set_color_from_coordinate();
+  std::string graph_file_name("data/graph");
+  N.set_graph_from_file(graph_file_name);
+  std::string cover_file_name("data/cover");
+  N.set_cover_from_file(cover_file_name);
+  N.find_simplices();
+  Gudhi::Simplex_tree<> stree;
+  N.create_complex(stree);
+
+  BOOST_CHECK(stree.num_vertices() == 3);
+  BOOST_CHECK((stree.num_simplices() - stree.num_vertices()) == 0);
+  BOOST_CHECK(stree.dimension() == 0);
+}
+
+BOOST_AUTO_TEST_CASE(check_GIC) {
+  using Point = std::vector<float>;
+  Gudhi::cover_complex::Cover_complex<Point> GIC;
+  GIC.set_type("GIC");
+  std::string cloud_file_name("data/cloud");
+  GIC.read_point_cloud(cloud_file_name);
+  GIC.set_color_from_coordinate();
+  std::string graph_file_name("data/graph");
+  GIC.set_graph_from_file(graph_file_name);
+  std::string cover_file_name("data/cover");
+  GIC.set_cover_from_file(cover_file_name);
+  GIC.find_simplices();
+  Gudhi::Simplex_tree<> stree;
+  GIC.create_complex(stree);
+
+  BOOST_CHECK(stree.num_vertices() == 3);
+  BOOST_CHECK((stree.num_simplices() - stree.num_vertices()) == 4);
+  BOOST_CHECK(stree.dimension() == 2);
+}
+
+BOOST_AUTO_TEST_CASE(check_voronoiGIC) {
+  using Point = std::vector<float>;
+  Gudhi::cover_complex::Cover_complex<Point> GIC;
+  GIC.set_type("GIC");
+  std::string cloud_file_name("data/cloud");
+  GIC.read_point_cloud(cloud_file_name);
+  GIC.set_color_from_coordinate();
+  std::string graph_file_name("data/graph");
+  GIC.set_graph_from_file(graph_file_name);
+  GIC.set_cover_from_Voronoi(Gudhi::Euclidean_distance(), 2);
+  GIC.find_simplices();
+  Gudhi::Simplex_tree<> stree;
+  GIC.create_complex(stree);
+
+  BOOST_CHECK(stree.num_vertices() == 2);
+  BOOST_CHECK((stree.num_simplices() - stree.num_vertices()) == 1);
+  BOOST_CHECK(stree.dimension() == 1);
+}