diff options
| -rw-r--r-- | src/Witness_complex/doc/Witness_complex_doc.h | 4 | ||||
| -rw-r--r-- | src/Witness_complex/example/example_strong_witness_complex_off.cpp | 4 |
2 files changed, 5 insertions, 3 deletions
diff --git a/src/Witness_complex/doc/Witness_complex_doc.h b/src/Witness_complex/doc/Witness_complex_doc.h index 247d862a..cd54887a 100644 --- a/src/Witness_complex/doc/Witness_complex_doc.h +++ b/src/Witness_complex/doc/Witness_complex_doc.h @@ -53,9 +53,11 @@ 2. Construct lists of nearest landmarks for each witness (special structure Gudhi::witness_complex::Active_witness is used internally). 3. Construct the witness complex for nearest landmark lists. + All the computations of nearest landmarks in Euclidean case are exact thanks to Gudhi::spatial_searching::Kd_tree_search data structure. + In the non-Euclidean classes, the lists of nearest landmarks are supposed to be given as input. - The constructors take on the step 1, while the function 'create_complex' executes the steps 2 and 3. + The constructors take on the steps 1 and 2, while the function 'create_complex' executes the step 3. \section witnessexample1 Example 1: Constructing weak relaxed witness complex from an off file 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 80699e78..61b8bc4a 100644 --- a/src/Witness_complex/example/example_strong_witness_complex_off.cpp +++ b/src/Witness_complex/example/example_strong_witness_complex_off.cpp @@ -37,7 +37,7 @@ int main(int argc, char * const argv[]) { Point_vector point_vector, landmarks; Gudhi::Points_off_reader<Point_d> off_reader(file_name); if (!off_reader.is_valid()) { - std::cerr << "Witness complex - Unable to read file " << file_name << "\n"; + std::cerr << "Strong witness complex - Unable to read file " << file_name << "\n"; exit(-1); // ----- >> } point_vector = Point_vector(off_reader.get_point_cloud()); @@ -55,7 +55,7 @@ int main(int argc, char * const argv[]) { witness_complex.create_complex(simplex_tree, alpha2, lim_dim); end = clock(); - std::cout << "Witness complex took " + std::cout << "Strong witness complex took " << static_cast<double>(end - start) / CLOCKS_PER_SEC << " s. \n"; std::cout << "Number of simplices is: " << simplex_tree.num_simplices() << "\n"; } |