summaryrefslogtreecommitdiff
path: root/src/Witness_complex/doc/Witness_complex_doc.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/Witness_complex/doc/Witness_complex_doc.h')
-rw-r--r--src/Witness_complex/doc/Witness_complex_doc.h4
1 files changed, 3 insertions, 1 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