From 68753b3c28321e28eedd5829c94234da84e25c8d Mon Sep 17 00:00:00 2001
From: ROUVREAU Vincent <vincent.rouvreau@inria.fr>
Date: Mon, 9 Sep 2019 16:03:40 +0200
Subject: Code review: rename cython as python (make target and directory

---
 src/python/include/Alpha_complex_interface.h | 72 ++++++++++++++++++++++++++++
 1 file changed, 72 insertions(+)
 create mode 100644 src/python/include/Alpha_complex_interface.h

(limited to 'src/python/include/Alpha_complex_interface.h')

diff --git a/src/python/include/Alpha_complex_interface.h b/src/python/include/Alpha_complex_interface.h
new file mode 100644
index 00000000..1199b741
--- /dev/null
+++ b/src/python/include/Alpha_complex_interface.h
@@ -0,0 +1,72 @@
+/*    This file is part of the Gudhi Library. The Gudhi library
+ *    (Geometric Understanding in Higher Dimensions) is a generic C++
+ *    library for computational topology.
+ *
+ *    Author(s):       Vincent Rouvreau
+ *
+ *    Copyright (C) 2016 Inria
+ *
+ *    Modification(s):
+ *      - YYYY/MM Author: Description of the modification
+ */
+
+#ifndef INCLUDE_ALPHA_COMPLEX_INTERFACE_H_
+#define INCLUDE_ALPHA_COMPLEX_INTERFACE_H_
+
+#include <gudhi/Simplex_tree.h>
+#include <gudhi/Alpha_complex.h>
+#include <CGAL/Epick_d.h>
+
+#include "Simplex_tree_interface.h"
+
+#include <iostream>
+#include <vector>
+#include <string>
+
+namespace Gudhi {
+
+namespace alpha_complex {
+
+class Alpha_complex_interface {
+  using Dynamic_kernel = CGAL::Epick_d< CGAL::Dynamic_dimension_tag >;
+  using Point_d = Dynamic_kernel::Point_d;
+
+ public:
+  Alpha_complex_interface(const std::vector<std::vector<double>>& points) {
+    alpha_complex_ = new Alpha_complex<Dynamic_kernel>(points);
+  }
+
+  Alpha_complex_interface(const std::string& off_file_name, bool from_file = true) {
+    alpha_complex_ = new Alpha_complex<Dynamic_kernel>(off_file_name);
+  }
+
+  ~Alpha_complex_interface() {
+    delete alpha_complex_;
+  }
+
+  std::vector<double> get_point(int vh) {
+    std::vector<double> vd;
+    try {
+      Point_d ph = alpha_complex_->get_point(vh);
+      for (auto coord = ph.cartesian_begin(); coord < ph.cartesian_end(); coord++)
+        vd.push_back(*coord);
+    } catch (std::out_of_range const&) {
+      // std::out_of_range is thrown in case not found. Other exceptions must be re-thrown
+    }
+    return vd;
+  }
+
+  void create_simplex_tree(Simplex_tree_interface<>* simplex_tree, double max_alpha_square) {
+    alpha_complex_->create_complex(*simplex_tree, max_alpha_square);
+    simplex_tree->initialize_filtration();
+  }
+
+ private:
+  Alpha_complex<Dynamic_kernel>* alpha_complex_;
+};
+
+}  // namespace alpha_complex
+
+}  // namespace Gudhi
+
+#endif  // INCLUDE_ALPHA_COMPLEX_INTERFACE_H_
-- 
cgit v1.2.3