From 35cc5b1de925ee845b638a4dae7409d23cf50edf Mon Sep 17 00:00:00 2001
From: skachano <skachano@636b058d-ea47-450e-bf9e-a15bfbe3eedb>
Date: Fri, 17 Nov 2017 11:17:47 +0000
Subject: Modified doc

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/wit_doc_corrections@2905 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 2e5b2ab68008719be5835bcad4aa38fbceaf2c9c
---
 src/Witness_complex/doc/Witness_complex_doc.h | 10 +++++++++-
 1 file changed, 9 insertions(+), 1 deletion(-)

(limited to 'src/Witness_complex/doc')

diff --git a/src/Witness_complex/doc/Witness_complex_doc.h b/src/Witness_complex/doc/Witness_complex_doc.h
index 171a185f..b51c3fe6 100644
--- a/src/Witness_complex/doc/Witness_complex_doc.h
+++ b/src/Witness_complex/doc/Witness_complex_doc.h
@@ -60,6 +60,7 @@
    \section witnessexample1 Example 1: Constructing weak relaxed witness complex from an off file
 
    Let's start with a simple example, which reads an off point file and computes a weak witness complex.
+   In this example, instead of choosing landmarks randomly, one can also use the farthest point selection provided by Gudhi::subsampling::choose_n_farthest_points.
 
    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~{.cpp}
    
@@ -90,7 +91,7 @@ int main(int argc, char * const argv[]) {
   Gudhi::Points_off_reader<Point_d> off_reader(file_name);
   point_vector = Point_vector(off_reader.get_point_cloud());
 
-  // Choose landmarks
+  // Choose landmarks (one can also use Gudhi::subsampling::choose_n_farthest_points)
   Gudhi::subsampling::pick_n_random_points(point_vector, nbL, std::back_inserter(landmarks));
 
   // Compute witness complex
@@ -109,6 +110,13 @@ int main(int argc, char * const argv[]) {
 
    \include Witness_complex/example_strong_witness_persistence.cpp
 
+   \section witnessexample3 Example3: Computing relaxed witness complex persistence from a distance matrix 
+
+   In this example we compute the relaxed witness complex persistence from a given matrix of closest landmarks to each witness.
+   Each landmark is given as the couple (index, distance).
+
+   \include Witness_complex/example_nearest_landmark_table.cpp
+
    \copyright GNU General Public License v3.
 
 
-- 
cgit v1.2.3


From b0273e0d9086cf649ce35b842730bb8c703188b2 Mon Sep 17 00:00:00 2001
From: skachano <skachano@636b058d-ea47-450e-bf9e-a15bfbe3eedb>
Date: Fri, 17 Nov 2017 12:24:31 +0000
Subject: Made farthest_points clickable

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/wit_doc_corrections@2908 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 452e4af3d270f02ce5bfe77309aca4a84772acba
---
 src/Witness_complex/doc/Witness_complex_doc.h              | 4 ++--
 src/Witness_complex/include/gudhi/Strong_witness_complex.h | 2 +-
 2 files changed, 3 insertions(+), 3 deletions(-)

(limited to 'src/Witness_complex/doc')

diff --git a/src/Witness_complex/doc/Witness_complex_doc.h b/src/Witness_complex/doc/Witness_complex_doc.h
index b51c3fe6..fb589a74 100644
--- a/src/Witness_complex/doc/Witness_complex_doc.h
+++ b/src/Witness_complex/doc/Witness_complex_doc.h
@@ -60,7 +60,7 @@
    \section witnessexample1 Example 1: Constructing weak relaxed witness complex from an off file
 
    Let's start with a simple example, which reads an off point file and computes a weak witness complex.
-   In this example, instead of choosing landmarks randomly, one can also use the farthest point selection provided by Gudhi::subsampling::choose_n_farthest_points.
+   In this example, instead of choosing landmarks randomly, one can also use the farthest point selection provided by Gudhi::subsampling::choose_n_farthest_points().
 
    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~{.cpp}
    
@@ -91,7 +91,7 @@ int main(int argc, char * const argv[]) {
   Gudhi::Points_off_reader<Point_d> off_reader(file_name);
   point_vector = Point_vector(off_reader.get_point_cloud());
 
-  // Choose landmarks (one can also use Gudhi::subsampling::choose_n_farthest_points)
+  // Choose landmarks (one can also use Gudhi::subsampling::choose_n_farthest_points())
   Gudhi::subsampling::pick_n_random_points(point_vector, nbL, std::back_inserter(landmarks));
 
   // Compute witness complex
diff --git a/src/Witness_complex/include/gudhi/Strong_witness_complex.h b/src/Witness_complex/include/gudhi/Strong_witness_complex.h
index c18335d3..f079e910 100644
--- a/src/Witness_complex/include/gudhi/Strong_witness_complex.h
+++ b/src/Witness_complex/include/gudhi/Strong_witness_complex.h
@@ -34,7 +34,7 @@ namespace Gudhi {
 
 namespace witness_complex {
 
-/* \private
+/* 
  * \class Strong_witness_complex
  * \brief Constructs strong witness complex for a given table of nearest landmarks with respect to witnesses.
  * \ingroup witness_complex
-- 
cgit v1.2.3


From e02efc78ac5e55512f145690391b0b794b139739 Mon Sep 17 00:00:00 2001
From: skachano <skachano@636b058d-ea47-450e-bf9e-a15bfbe3eedb>
Date: Fri, 17 Nov 2017 13:01:02 +0000
Subject: Added the commented choose_n_farthest_points everywhere

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/wit_doc_corrections@2909 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 9f7a325facf798748c4c08e3815fbbd3d4075b78
---
 src/Witness_complex/doc/Witness_complex_doc.h                     | 6 +++---
 .../example/example_strong_witness_complex_off.cpp                | 8 +++++---
 .../example/example_strong_witness_persistence.cpp                | 6 ++++--
 src/Witness_complex/example/example_witness_complex_off.cpp       | 6 ++++--
 .../example/example_witness_complex_persistence.cpp               | 6 ++++--
 src/Witness_complex/example/example_witness_complex_sphere.cpp    | 4 +++-
 src/Witness_complex/include/gudhi/Strong_witness_complex.h        | 5 +++--
 7 files changed, 26 insertions(+), 15 deletions(-)

(limited to 'src/Witness_complex/doc')

diff --git a/src/Witness_complex/doc/Witness_complex_doc.h b/src/Witness_complex/doc/Witness_complex_doc.h
index fb589a74..d070ee34 100644
--- a/src/Witness_complex/doc/Witness_complex_doc.h
+++ b/src/Witness_complex/doc/Witness_complex_doc.h
@@ -60,7 +60,6 @@
    \section witnessexample1 Example 1: Constructing weak relaxed witness complex from an off file
 
    Let's start with a simple example, which reads an off point file and computes a weak witness complex.
-   In this example, instead of choosing landmarks randomly, one can also use the farthest point selection provided by Gudhi::subsampling::choose_n_farthest_points().
 
    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~{.cpp}
    
@@ -91,8 +90,9 @@ int main(int argc, char * const argv[]) {
   Gudhi::Points_off_reader<Point_d> off_reader(file_name);
   point_vector = Point_vector(off_reader.get_point_cloud());
 
-  // Choose landmarks (one can also use Gudhi::subsampling::choose_n_farthest_points())
-  Gudhi::subsampling::pick_n_random_points(point_vector, nbL, std::back_inserter(landmarks));
+  // Choose landmarks (one can choose either of the two methods below)
+  // Gudhi::subsampling::pick_n_random_points(point_vector, nbL, std::back_inserter(landmarks));
+  Gudhi::subsampling::choose_n_farthest_points(K(), point_vector, nbL, Gudhi::subsampling::random_starting_point, std::back_inserter(landmarks));
 
   // Compute witness complex
   Witness_complex witness_complex(landmarks,
diff --git a/src/Witness_complex/example/example_strong_witness_complex_off.cpp b/src/Witness_complex/example/example_strong_witness_complex_off.cpp
index 0ee9ee90..bc069654 100644
--- a/src/Witness_complex/example/example_strong_witness_complex_off.cpp
+++ b/src/Witness_complex/example/example_strong_witness_complex_off.cpp
@@ -23,6 +23,7 @@
 #include <gudhi/Simplex_tree.h>
 #include <gudhi/Euclidean_strong_witness_complex.h>
 #include <gudhi/pick_n_random_points.h>
+#include <gudhi/choose_n_farthest_points.h>
 #include <gudhi/Points_off_io.h>
 
 #include <CGAL/Epick_d.h>
@@ -63,9 +64,10 @@ int main(int argc, char * const argv[]) {
   std::cout << "Successfully read " << point_vector.size() << " points.\n";
   std::cout << "Ambient dimension is " << point_vector[0].dimension() << ".\n";
 
-  // Choose landmarks
-  Gudhi::subsampling::pick_n_random_points(point_vector, nbL, std::back_inserter(landmarks));
-
+  // Choose landmarks (decomment one of the following two lines)
+  // Gudhi::subsampling::pick_n_random_points(point_vector, nbL, std::back_inserter(landmarks));
+  Gudhi::subsampling::choose_n_farthest_points(K(), point_vector, nbL, Gudhi::subsampling::random_starting_point, std::back_inserter(landmarks));
+  
   // Compute witness complex
   start = clock();
   Witness_complex witness_complex(landmarks,
diff --git a/src/Witness_complex/example/example_strong_witness_persistence.cpp b/src/Witness_complex/example/example_strong_witness_persistence.cpp
index 1f0c5a42..e3e0c1ee 100644
--- a/src/Witness_complex/example/example_strong_witness_persistence.cpp
+++ b/src/Witness_complex/example/example_strong_witness_persistence.cpp
@@ -25,6 +25,7 @@
 #include <gudhi/Persistent_cohomology.h>
 #include <gudhi/Points_off_io.h>
 #include <gudhi/pick_n_random_points.h>
+#include <gudhi/choose_n_farthest_points.h>
 
 #include <boost/program_options.hpp>
 
@@ -76,8 +77,9 @@ int main(int argc, char * argv[]) {
   std::cout << "Successfully read " << witnesses.size() << " points.\n";
   std::cout << "Ambient dimension is " << witnesses[0].dimension() << ".\n";
 
-  // Choose landmarks from witnesses (one can also use Gudhi::subsampling::choose_n_farthest_points)
-  Gudhi::subsampling::pick_n_random_points(witnesses, nbL, std::back_inserter(landmarks));
+  // Choose landmarks (decomment one of the following two lines)
+  // Gudhi::subsampling::pick_n_random_points(point_vector, nbL, std::back_inserter(landmarks));
+  Gudhi::subsampling::choose_n_farthest_points(K(), witnesses, nbL, Gudhi::subsampling::random_starting_point, std::back_inserter(landmarks));
 
   // Compute witness complex
   Strong_witness_complex strong_witness_complex(landmarks,
diff --git a/src/Witness_complex/example/example_witness_complex_off.cpp b/src/Witness_complex/example/example_witness_complex_off.cpp
index b36dac0d..be11c955 100644
--- a/src/Witness_complex/example/example_witness_complex_off.cpp
+++ b/src/Witness_complex/example/example_witness_complex_off.cpp
@@ -4,6 +4,7 @@
 #include <gudhi/Simplex_tree.h>
 #include <gudhi/Euclidean_witness_complex.h>
 #include <gudhi/pick_n_random_points.h>
+#include <gudhi/choose_n_farthest_points.h>
 #include <gudhi/Points_off_io.h>
 
 #include <CGAL/Epick_d.h>
@@ -44,8 +45,9 @@ int main(int argc, char * const argv[]) {
   std::cout << "Successfully read " << point_vector.size() << " points.\n";
   std::cout << "Ambient dimension is " << point_vector[0].dimension() << ".\n";
 
-  // Choose landmarks
-  Gudhi::subsampling::pick_n_random_points(point_vector, nbL, std::back_inserter(landmarks));
+  // Choose landmarks (decomment one of the following two lines)
+  // Gudhi::subsampling::pick_n_random_points(point_vector, nbL, std::back_inserter(landmarks));
+  Gudhi::subsampling::choose_n_farthest_points(K(), point_vector, nbL, Gudhi::subsampling::random_starting_point, std::back_inserter(landmarks));
 
   // Compute witness complex
   start = clock();
diff --git a/src/Witness_complex/example/example_witness_complex_persistence.cpp b/src/Witness_complex/example/example_witness_complex_persistence.cpp
index a1146922..a63b0837 100644
--- a/src/Witness_complex/example/example_witness_complex_persistence.cpp
+++ b/src/Witness_complex/example/example_witness_complex_persistence.cpp
@@ -25,6 +25,7 @@
 #include <gudhi/Persistent_cohomology.h>
 #include <gudhi/Points_off_io.h>
 #include <gudhi/pick_n_random_points.h>
+#include <gudhi/choose_n_farthest_points.h>
 
 #include <boost/program_options.hpp>
 
@@ -76,8 +77,9 @@ int main(int argc, char * argv[]) {
   std::cout << "Successfully read " << witnesses.size() << " points.\n";
   std::cout << "Ambient dimension is " << witnesses[0].dimension() << ".\n";
 
-  // Choose landmarks from witnesses
-  Gudhi::subsampling::pick_n_random_points(witnesses, nbL, std::back_inserter(landmarks));
+  // Choose landmarks (decomment one of the following two lines)
+  // Gudhi::subsampling::pick_n_random_points(point_vector, nbL, std::back_inserter(landmarks));
+  Gudhi::subsampling::choose_n_farthest_points(K(), witnesses, nbL, Gudhi::subsampling::random_starting_point, std::back_inserter(landmarks));
 
   // Compute witness complex
   Witness_complex witness_complex(landmarks,
diff --git a/src/Witness_complex/example/example_witness_complex_sphere.cpp b/src/Witness_complex/example/example_witness_complex_sphere.cpp
index 124fd99b..a66da3f9 100644
--- a/src/Witness_complex/example/example_witness_complex_sphere.cpp
+++ b/src/Witness_complex/example/example_witness_complex_sphere.cpp
@@ -25,6 +25,7 @@
 #include <gudhi/Simplex_tree.h>
 #include <gudhi/Euclidean_witness_complex.h>
 #include <gudhi/pick_n_random_points.h>
+#include <gudhi/choose_n_farthest_points.h>
 #include <gudhi/reader_utils.h>
 
 #include <CGAL/Epick_d.h>
@@ -75,7 +76,8 @@ int main(int argc, char * const argv[]) {
 
     // Choose landmarks
     start = clock();
-    Gudhi::subsampling::pick_n_random_points(point_vector, number_of_landmarks, std::back_inserter(landmarks));
+    // Gudhi::subsampling::pick_n_random_points(point_vector, number_of_landmarks, std::back_inserter(landmarks));
+    Gudhi::subsampling::choose_n_farthest_points(K(), point_vector, number_of_landmarks, Gudhi::subsampling::random_starting_point, std::back_inserter(landmarks));
 
     // Compute witness complex
     Witness_complex witness_complex(landmarks,
diff --git a/src/Witness_complex/include/gudhi/Strong_witness_complex.h b/src/Witness_complex/include/gudhi/Strong_witness_complex.h
index f079e910..38646201 100644
--- a/src/Witness_complex/include/gudhi/Strong_witness_complex.h
+++ b/src/Witness_complex/include/gudhi/Strong_witness_complex.h
@@ -34,7 +34,7 @@ namespace Gudhi {
 
 namespace witness_complex {
 
-/* 
+/* \private
  * \class Strong_witness_complex
  * \brief Constructs strong witness complex for a given table of nearest landmarks with respect to witnesses.
  * \ingroup witness_complex
@@ -130,6 +130,8 @@ class Strong_witness_complex {
     return true;
   }
 
+  //@}
+
  private:
     /* \brief Adds recursively all the faces of a certain dimension dim-1 witnessed by the same witness.
      * Iterator is needed to know until how far we can take landmarks to form simplexes.
@@ -170,7 +172,6 @@ class Strong_witness_complex {
       simplex.pop_back();
     }
   }
-  //@}
 };
 
 }  // namespace witness_complex
-- 
cgit v1.2.3


From b674e9a5fae8bdbb22eadb9a7c0013ce84451743 Mon Sep 17 00:00:00 2001
From: vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>
Date: Fri, 26 Jan 2018 14:55:28 +0000
Subject: Move documentation Copyright in footer Removed from each module

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/trunk@3167 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 7595f2d18cdc3773bbd96fa9fed414876ff9fdc7
---
 src/Alpha_complex/doc/Intro_alpha_complex.h                    |  4 +---
 src/Bitmap_cubical_complex/doc/Gudhi_Cubical_Complex_doc.h     |  1 -
 src/Contraction/include/gudhi/Edge_contraction.h               |  4 ----
 src/Nerve_GIC/doc/Intro_graph_induced_complex.h                |  1 -
 .../doc/Persistence_representations_doc.h                      |  1 -
 src/Persistent_cohomology/doc/Intro_persistent_cohomology.h    |  1 -
 src/Rips_complex/doc/Intro_rips_complex.h                      |  2 --
 src/Simplex_tree/doc/Intro_simplex_tree.h                      |  1 -
 src/Skeleton_blocker/include/gudhi/Skeleton_blocker.h          |  3 ---
 src/Spatial_searching/doc/Intro_spatial_searching.h            |  2 --
 src/Subsampling/doc/Intro_subsampling.h                        |  2 --
 src/Tangential_complex/doc/Intro_tangential_complex.h          |  2 --
 src/Witness_complex/doc/Witness_complex_doc.h                  |  3 ---
 src/common/doc/footer.html                                     | 10 ++--------
 14 files changed, 3 insertions(+), 34 deletions(-)

(limited to 'src/Witness_complex/doc')

diff --git a/src/Alpha_complex/doc/Intro_alpha_complex.h b/src/Alpha_complex/doc/Intro_alpha_complex.h
index cf1a946a..a08663ca 100644
--- a/src/Alpha_complex/doc/Intro_alpha_complex.h
+++ b/src/Alpha_complex/doc/Intro_alpha_complex.h
@@ -31,7 +31,7 @@ namespace alpha_complex {
 /**  \defgroup alpha_complex Alpha complex
  * 
  * \author    Vincent Rouvreau
- * 
+ *
  * @{
  * 
  * \section definition Definition
@@ -195,8 +195,6 @@ namespace alpha_complex {
  * 
  * \include Alpha_complex/alphaoffreader_for_doc_32.txt
  * 
- * \copyright GNU General Public License v3.                         
- * \verbatim  Contact: gudhi-users@lists.gforge.inria.fr \endverbatim
  */
 /** @} */  // end defgroup alpha_complex
 
diff --git a/src/Bitmap_cubical_complex/doc/Gudhi_Cubical_Complex_doc.h b/src/Bitmap_cubical_complex/doc/Gudhi_Cubical_Complex_doc.h
index ee84e201..a5d7b60f 100644
--- a/src/Bitmap_cubical_complex/doc/Gudhi_Cubical_Complex_doc.h
+++ b/src/Bitmap_cubical_complex/doc/Gudhi_Cubical_Complex_doc.h
@@ -105,7 +105,6 @@ namespace cubical_complex {
  * \section BitmapExamples Examples
  * End user programs are available in example/Bitmap_cubical_complex and utilities/Bitmap_cubical_complex folders.
  * 
- * \copyright GNU General Public License v3.
  */
 /** @} */  // end defgroup cubical_complex
 
diff --git a/src/Contraction/include/gudhi/Edge_contraction.h b/src/Contraction/include/gudhi/Edge_contraction.h
index 61f2d945..cf9a2c27 100644
--- a/src/Contraction/include/gudhi/Edge_contraction.h
+++ b/src/Contraction/include/gudhi/Edge_contraction.h
@@ -210,7 +210,6 @@ int main (int argc, char *argv[])
 }
   \endcode
 
-
 \verbatim
 ./example/Contraction/RipsContraction ../../data/SO3_10000.off 0.3
 [ 50%] [100%] Built target SkeletonBlockerIteration
@@ -223,9 +222,6 @@ Time to simplify and enumerate simplices:
  3.166621s wall, 3.150000s user + 0.010000s system = 3.160000s CPU (99.8%)
 \endverbatim
 
-
-
-\copyright GNU General Public License v3.                         
 */
 /** @} */  // end defgroup
 }  // namespace contraction
diff --git a/src/Nerve_GIC/doc/Intro_graph_induced_complex.h b/src/Nerve_GIC/doc/Intro_graph_induced_complex.h
index 344cb031..f2409087 100644
--- a/src/Nerve_GIC/doc/Intro_graph_induced_complex.h
+++ b/src/Nerve_GIC/doc/Intro_graph_induced_complex.h
@@ -176,7 +176,6 @@ namespace cover_complex {
  *
  * \image html "funcGICvisu.jpg" "Visualization with neato"
  *
- * \copyright GNU General Public License v3.                         
  */
 /** @} */  // end defgroup cover_complex
 
diff --git a/src/Persistence_representations/doc/Persistence_representations_doc.h b/src/Persistence_representations/doc/Persistence_representations_doc.h
index 978fb5bd..d781211a 100644
--- a/src/Persistence_representations/doc/Persistence_representations_doc.h
+++ b/src/Persistence_representations/doc/Persistence_representations_doc.h
@@ -250,7 +250,6 @@ namespace Persistence_representations {
  absolute value of differences between coordinates. A scalar product is a sum of products of
  values at the corresponding positions of two vectors.
 
- \copyright GNU General Public License v3.
  */
 /** @} */  // end defgroup Persistence_representations
 
diff --git a/src/Persistent_cohomology/doc/Intro_persistent_cohomology.h b/src/Persistent_cohomology/doc/Intro_persistent_cohomology.h
index ceaea505..4dbe82c7 100644
--- a/src/Persistent_cohomology/doc/Intro_persistent_cohomology.h
+++ b/src/Persistent_cohomology/doc/Intro_persistent_cohomology.h
@@ -248,7 +248,6 @@ Simplex_tree dim: 3
 Persistent_cohomology/plain_homology.cpp</a> computes the plain homology of a simple simplicial complex without
 filtration values.
 
- \copyright GNU General Public License v3.
  */
 
 }  // namespace persistent_cohomology
diff --git a/src/Rips_complex/doc/Intro_rips_complex.h b/src/Rips_complex/doc/Intro_rips_complex.h
index 124dfec9..8c517516 100644
--- a/src/Rips_complex/doc/Intro_rips_complex.h
+++ b/src/Rips_complex/doc/Intro_rips_complex.h
@@ -146,8 +146,6 @@ namespace rips_complex {
  * 
  * \include Rips_complex/full_skeleton_rips_for_doc.txt
  * 
- * \copyright GNU General Public License v3.                         
- * \verbatim  Contact: gudhi-users@lists.gforge.inria.fr \endverbatim
  */
 /** @} */  // end defgroup rips_complex
 
diff --git a/src/Simplex_tree/doc/Intro_simplex_tree.h b/src/Simplex_tree/doc/Intro_simplex_tree.h
index 769491d9..6b80d1c9 100644
--- a/src/Simplex_tree/doc/Intro_simplex_tree.h
+++ b/src/Simplex_tree/doc/Intro_simplex_tree.h
@@ -79,7 +79,6 @@ Number of vertices = 10   Number of simplices = 98 \endcode
  * 1 incidence relations in a complex. It is consequently faster when accessing the boundary of a simplex, but is less
  * compact and harder to construct from scratch.
  * 
- * \copyright GNU General Public License v3.
  * @}
  */
 
diff --git a/src/Skeleton_blocker/include/gudhi/Skeleton_blocker.h b/src/Skeleton_blocker/include/gudhi/Skeleton_blocker.h
index 32fe411c..aca2aa57 100644
--- a/src/Skeleton_blocker/include/gudhi/Skeleton_blocker.h
+++ b/src/Skeleton_blocker/include/gudhi/Skeleton_blocker.h
@@ -239,9 +239,6 @@ their collaboration to write the two initial papers
  about this data-structure
  and also Dominique for leaving him use a prototype.
 
-
-\copyright GNU General Public License v3.
-
 @} */
 
 }  // namespace skeleton_blocker
diff --git a/src/Spatial_searching/doc/Intro_spatial_searching.h b/src/Spatial_searching/doc/Intro_spatial_searching.h
index 1ee5e92e..52ed65e4 100644
--- a/src/Spatial_searching/doc/Intro_spatial_searching.h
+++ b/src/Spatial_searching/doc/Intro_spatial_searching.h
@@ -50,8 +50,6 @@ namespace spatial_searching {
  * 
  * \include Spatial_searching/example_spatial_searching.cpp
  * 
- * \copyright GNU General Public License v3.                         
- * \verbatim  Contact: gudhi-users@lists.gforge.inria.fr \endverbatim
  */
 /** @} */  // end defgroup spatial_searching
 
diff --git a/src/Subsampling/doc/Intro_subsampling.h b/src/Subsampling/doc/Intro_subsampling.h
index c84616dd..ab9cdc37 100644
--- a/src/Subsampling/doc/Intro_subsampling.h
+++ b/src/Subsampling/doc/Intro_subsampling.h
@@ -58,8 +58,6 @@ namespace subsampling {
  * This example outputs a subset of 100 points picked randomly.
  *
  * \include Subsampling/example_pick_n_random_points.cpp
- * \copyright GNU General Public License v3.                         
- * \verbatim  Contact: gudhi-users@lists.gforge.inria.fr \endverbatim
  */
 /** @} */  // end defgroup subsampling
 
diff --git a/src/Tangential_complex/doc/Intro_tangential_complex.h b/src/Tangential_complex/doc/Intro_tangential_complex.h
index 3d687c1d..00e00c52 100644
--- a/src/Tangential_complex/doc/Intro_tangential_complex.h
+++ b/src/Tangential_complex/doc/Intro_tangential_complex.h
@@ -107,8 +107,6 @@ dimensions are known at compile-time.
 
 \include Tangential_complex/example_with_perturb.cpp
 
-\copyright GNU General Public License v3.                         
-\verbatim  Contact: gudhi-users@lists.gforge.inria.fr \endverbatim
  */
 /** @} */  // end defgroup tangential_complex
 
diff --git a/src/Witness_complex/doc/Witness_complex_doc.h b/src/Witness_complex/doc/Witness_complex_doc.h
index 5d5c0735..62203054 100644
--- a/src/Witness_complex/doc/Witness_complex_doc.h
+++ b/src/Witness_complex/doc/Witness_complex_doc.h
@@ -117,9 +117,6 @@ int main(int argc, char * const argv[]) {
 
    \include Witness_complex/example_nearest_landmark_table.cpp
 
-   \copyright GNU General Public License v3.
-
-
  */
 
 #endif  // WITNESS_COMPLEX_DOC_H_
diff --git a/src/common/doc/footer.html b/src/common/doc/footer.html
index 7b4cdc5c..a557922b 100644
--- a/src/common/doc/footer.html
+++ b/src/common/doc/footer.html
@@ -6,24 +6,18 @@
 <!--BEGIN PROJECT_NAME--> $projectname
 <!--BEGIN PROJECT_NUMBER-->&#160;Version $projectnumber<!--END PROJECT_NUMBER-->
 <!--BEGIN PROJECT_BRIEF-->&#160;-&#160;$projectbrief<!--END PROJECT_BRIEF-->
+<!--BEGIN PROJECT_BRIEF-->&#160;-&#160;Copyright : GPL v3<!--END PROJECT_BRIEF-->
 <!--END PROJECT_NAME-->
       </td>
       <td class="network-entypo">
 <!--BEGIN GENERATE_TREEVIEW-->
         $generatedby
         <a href="http://www.doxygen.org/index.html">
-        <img class="footer" src="$relpath^doxygen.png" alt="doxygen"/></a> $doxygenversion
+        Doxygen</a> $doxygenversion
 <!--END GENERATE_TREEVIEW-->
       </td>
   </tr>
 </table>
 
-<!--BEGIN !GENERATE_TREEVIEW-->
-<hr class="footer"/><address class="footer"><small> tralala
-$generatedby &#160;<a href="http://www.doxygen.org/index.html">
-<img class="footer" src="$relpath^doxygen.png" alt="doxygen"/>
-</a> $doxygenversion
-</small></address>
-<!--END !GENERATE_TREEVIEW-->
 </body>
 </html>
-- 
cgit v1.2.3