From ba522fc8c114b2de36c4b399d74edce8883d2577 Mon Sep 17 00:00:00 2001 From: skachano Date: Mon, 30 Jan 2017 12:37:32 +0000 Subject: Added a line to doc following Clément's comment MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/relaxed-witness@2026 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: a3d4afc6110079c9826045c9de61fab9bc52f31e --- src/Witness_complex/doc/Witness_complex_doc.h | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) (limited to 'src/Witness_complex/doc/Witness_complex_doc.h') 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 -- cgit v1.2.3