1 files changed, 103 insertions, 0 deletions
diff --git a/src/Persistence_representations/include/gudhi/Landscape.h b/src/Persistence_representations/include/gudhi/Landscape.h
new file mode 100644
index 00000000..d6608a57
--- /dev/null
+++ b/src/Persistence_representations/include/gudhi/Landscape.h
@@ -0,0 +1,103 @@
+/*    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):       Mathieu Carriere
+ *
+ *    Copyright (C) 2018  INRIA (France)
+ *
+ *    This program is free software: you can redistribute it and/or modify
+ *    it under the terms of the GNU General Public License as published by
+ *    the Free Software Foundation, either version 3 of the License, or
+ *    (at your option) any later version.
+ *
+ *    This program is distributed in the hope that it will be useful,
+ *    but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *    GNU General Public License for more details.
+ *
+ *    You should have received a copy of the GNU General Public License
+ *    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+
+#ifndef LANDSCAPE_H_
+#define LANDSCAPE_H_
+
+// gudhi include
+#include <gudhi/read_persistence_from_file.h>
+#include <gudhi/common_persistence_representations.h>
+#include <gudhi/Debug_utils.h>
+
+// standard include
+#include <cmath>
+#include <iostream>
+#include <vector>
+#include <limits>
+#include <fstream>
+#include <sstream>
+#include <algorithm>
+#include <string>
+#include <utility>
+#include <functional>
+
+using PD = std::vector<std::pair<double,double> >;
+
+namespace Gudhi {
+namespace Persistence_representations {
+
+/**
+ * \class Landscape gudhi/Landscape.h
+ * \brief A class implementing the Landscapes.
+ *
+ * \ingroup Persistence_representations
+ *
+ * \details
+ *
+**/
+
+class Landscape {
+
+ protected:
+    PD diagram;
+    int res_x, nb_ls;
+    double min_x, max_x;
+
+  public:
+
+  /** \brief Landscape constructor.
+   * \ingroup Landscape
+   *
+   */
+  Landscape(PD _diagram, int _nb_ls = 5, double _min_x = 0.0, double _max_x = 1.0, int _res_x = 10){diagram = _diagram; nb_ls = _nb_ls; min_x = _min_x; max_x = _max_x; res_x = _res_x;}
+
+  /** \brief Computes the landscape of a diagram.
+   * \ingroup Landscape
+   *
+   */
+  std::vector<std::vector<double> > vectorize() {
+    std::vector<std::vector<double> >  ls; for(int i = 0; i < nb_ls; i++)  ls.emplace_back();
+    int num_pts = diagram.size(); double step = (max_x - min_x)/res_x;
+
+    for(int i = 0; i < res_x; i++){
+      double x = min_x + i*step; double t = x / std::sqrt(2); std::vector<double> events;
+      for(int j = 0; j < num_pts; j++){
+        double px = diagram[j].first; double py = diagram[j].second;
+        if(t >= px && t <= py){  if(t >= (px+py)/2)  events.push_back(std::sqrt(2)*(py-t)); else  events.push_back(std::sqrt(2)*(t-px));  }
+      }
+
+      std::sort(events.begin(), events.end(), [](const double & a, const double & b){return a > b;}); int nb_events = events.size();
+      for (int j = 0; j < nb_ls; j++){  if(j < nb_events)  ls[j].push_back(events[j]);  else  ls[j].push_back(0);  }
+    }
+
+    return ls;
+  }
+
+
+
+
+};
+
+}  // namespace Landscape
+}  // namespace Gudhi
+
+#endif  // LANDSCAPE_H_