From a63c390725163a69943a0f144f78659debb8ae09 Mon Sep 17 00:00:00 2001 From: skachano Date: Mon, 30 Jan 2017 14:22:57 +0000 Subject: Removed 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@2028 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: ea36d149b9771bba2a40816e564ffde02080b931 --- src/Witness_complex/doc/Witness_complex_doc.h | 2 -- 1 file changed, 2 deletions(-) (limited to 'src/Witness_complex/doc') 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. -- cgit v1.2.3