diff options
| -rw-r--r-- | src/Rips_complex/doc/Intro_rips_complex.h | 6 | ||||
| -rw-r--r-- | src/Rips_complex/example/CMakeLists.txt | 2 |
2 files changed, 5 insertions, 3 deletions
diff --git a/src/Rips_complex/doc/Intro_rips_complex.h b/src/Rips_complex/doc/Intro_rips_complex.h index 96d90d98..81f24c71 100644 --- a/src/Rips_complex/doc/Intro_rips_complex.h +++ b/src/Rips_complex/doc/Intro_rips_complex.h @@ -44,8 +44,10 @@ namespace rips_complex { * simplex is the diameter of the corresponding subset of points. * * This filtered complex is most often used as an approximation of the - * Čech complex (they share the same 1-skeleton and are multiplicatively - * 2-interleaved or better), which is slightly bigger but easier to compute. + * Čech complex. After rescaling (Rips using the length of the edges and Čech + * the half-length), they share the same 1-skeleton and are multiplicatively + * 2-interleaved or better. While it is slightly bigger, it is also much + * easier to compute. * * The number of simplices in the full Rips complex is exponential in the * number of vertices, it is thus usually restricted, by excluding all the diff --git a/src/Rips_complex/example/CMakeLists.txt b/src/Rips_complex/example/CMakeLists.txt index 8a22a6d8..d05d3e57 100644 --- a/src/Rips_complex/example/CMakeLists.txt +++ b/src/Rips_complex/example/CMakeLists.txt @@ -12,7 +12,7 @@ add_executable ( Rips_complex_example_one_skeleton_from_distance_matrix example_ add_executable ( Rips_complex_example_from_csv_distance_matrix example_rips_complex_from_csv_distance_matrix_file.cpp ) # Point cloud -add_executable ( Rips_complex_example_sparse example_sparse_rips_complex.cpp ) +add_executable ( Rips_complex_example_sparse example_sparse_rips.cpp ) if (TBB_FOUND) target_link_libraries(Rips_complex_example_from_off ${TBB_LIBRARIES}) |