diff options
Diffstat (limited to 'src/Witness_complex/doc/Witness_complex_doc.h')
| -rw-r--r-- | src/Witness_complex/doc/Witness_complex_doc.h | 2 |
1 files changed, 0 insertions, 2 deletions
diff --git a/src/Witness_complex/doc/Witness_complex_doc.h b/src/Witness_complex/doc/Witness_complex_doc.h index cd54887a..171a185f 100644 --- a/src/Witness_complex/doc/Witness_complex_doc.h +++ b/src/Witness_complex/doc/Witness_complex_doc.h @@ -53,8 +53,6 @@ 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 steps 1 and 2, while the function 'create_complex' executes the step 3. |