diff options
author | skachano <skachano@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2017-11-17 11:17:47 +0000 |
---|---|---|
committer | skachano <skachano@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2017-11-17 11:17:47 +0000 |
commit | 35cc5b1de925ee845b638a4dae7409d23cf50edf (patch) | |
tree | 291254766a558506c03bed50bc0eaf6fb55b1c90 /src/Witness_complex | |
parent | ad54d00d460d7c741943febc8a71bf26a97dabdb (diff) |
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
Diffstat (limited to 'src/Witness_complex')
-rw-r--r-- | src/Witness_complex/doc/Witness_complex_doc.h | 10 |
1 files changed, 9 insertions, 1 deletions
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. |