diff options
| author | pdlotko <pdlotko@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2016-02-05 12:24:49 +0000 |
|---|---|---|
| committer | pdlotko <pdlotko@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2016-02-05 12:24:49 +0000 |
| commit | 7fe2c44c56e4fbd176131f31bc4338932f7a9d32 (patch) | |
| tree | 64931e5659204a6e128676e4aeed56a69cc5240b /src/Bitmap_cubical_complex/example/Compute_persistence_with_phat.cpp | |
| parent | 35143d2a24e7a601a4629a7cfe43ea6b8ea35f1a (diff) | |
Over here I have linkd phat with Gudhi. So far it is done only for cubical complexes, but since I am ONLY using Filtration_simplex_iterator, there should be no problem to have it run with any other class we have.
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/bitmap@1004 636b058d-ea47-450e-bf9e-a15bfbe3eedb
Former-commit-id: ddb3e2c5fa0c2a816e7435c57d32c0644f8163d2
Diffstat (limited to 'src/Bitmap_cubical_complex/example/Compute_persistence_with_phat.cpp')
| -rw-r--r-- | src/Bitmap_cubical_complex/example/Compute_persistence_with_phat.cpp | 60 |
1 files changed, 60 insertions, 0 deletions
diff --git a/src/Bitmap_cubical_complex/example/Compute_persistence_with_phat.cpp b/src/Bitmap_cubical_complex/example/Compute_persistence_with_phat.cpp new file mode 100644 index 00000000..fe9be33e --- /dev/null +++ b/src/Bitmap_cubical_complex/example/Compute_persistence_with_phat.cpp @@ -0,0 +1,60 @@ +
+ /* 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): Pawel Dlotko
+ *
+ * Copyright (C) 2015 INRIA Saclay (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/>.
+ */
+
+
+#include <gudhi/reader_utils.h>
+#include <gudhi/Bitmap_cubical_complex_base.h>
+#include <gudhi/Bitmap_cubical_complex_periodic_boundary_conditions_base.h>
+#include <gudhi/Bitmap_cubical_complex.h>
+#include <gudhi/Compute_persistence_with_phat.h>
+
+using namespace Gudhi;
+using namespace Gudhi::Cubical_complex;
+
+//standard stuff
+#include <iostream>
+#include <sstream>
+#include <vector>
+
+using namespace std;
+
+
+int main( int argc , char** argv )
+{
+ if ( argc != 2 )
+ {
+ cout << "Wrong number of parameters. Please provide the name of a file with a Perseus style bitmap at the input. The program will now terminate.\n";
+ return 1;
+ }
+
+ Bitmap_cubical_complex< Bitmap_cubical_complex_base<double> > b( argv[1] );
+ cerr << "Cubical complex created \n";
+
+
+ Compute_persistence_with_phat< Bitmap_cubical_complex< Bitmap_cubical_complex_base<double> > , double > phat(&b);
+ phat::persistence_pairs pairs = phat.compute_persistence_pairs_dualized_chunk_reduction();
+ std::pair< std::vector< std::vector<double> > , std::vector< std::vector< std::pair<double,double> > > > persistence = phat.get_the_intervals( pairs );
+ writeBettiNumbersAndPersistenceIntervalsToFile( "phat_persistence" , persistence );
+
+ return 0;
+}
|