From 8d7329f3e5ad843e553c3c5503cecc28ef2eead6 Mon Sep 17 00:00:00 2001
From: Gard Spreemann <gspreemann@gmail.com>
Date: Thu, 20 Apr 2017 11:10:45 +0200
Subject: GUDHI 2.0.0 as released by upstream in a tarball.

---
 example/Tangential_complex/example_basic.cpp | 46 ++++++++++++++++++++++++++++
 1 file changed, 46 insertions(+)
 create mode 100644 example/Tangential_complex/example_basic.cpp

(limited to 'example/Tangential_complex/example_basic.cpp')

diff --git a/example/Tangential_complex/example_basic.cpp b/example/Tangential_complex/example_basic.cpp
new file mode 100644
index 00000000..4f2b859e
--- /dev/null
+++ b/example/Tangential_complex/example_basic.cpp
@@ -0,0 +1,46 @@
+#include <gudhi/Tangential_complex.h>
+#include <gudhi/sparsify_point_set.h>
+
+#include <CGAL/Epick_d.h>
+#include <CGAL/Random.h>
+
+#include <array>
+#include <vector>
+
+namespace tc = Gudhi::tangential_complex;
+
+typedef CGAL::Epick_d<CGAL::Dynamic_dimension_tag> Kernel;
+typedef Kernel::FT FT;
+typedef Kernel::Point_d Point;
+typedef Kernel::Vector_d Vector;
+typedef tc::Tangential_complex<
+Kernel, CGAL::Dynamic_dimension_tag,
+CGAL::Parallel_tag> TC;
+
+int main(void) {
+  const int INTRINSIC_DIM = 2;
+  const int AMBIENT_DIM = 3;
+  const int NUM_POINTS = 1000;
+
+  Kernel k;
+
+  // Generate points on a 2-sphere
+  CGAL::Random_points_on_sphere_d<Point> generator(AMBIENT_DIM, 3.);
+  std::vector<Point> points;
+  points.reserve(NUM_POINTS);
+  for (int i = 0; i < NUM_POINTS; ++i)
+    points.push_back(*generator++);
+
+  // Compute the TC
+  TC tc(points, INTRINSIC_DIM, k);
+  tc.compute_tangential_complex();
+
+  // Export the TC into a Simplex_tree
+  Gudhi::Simplex_tree<> stree;
+  tc.create_complex(stree);
+
+  // Display stats about inconsistencies
+  tc.number_of_inconsistent_simplices(true);  // verbose
+
+  return 0;
+}
-- 
cgit v1.2.3