From 9afff26c8f15121aa58eb1a1beacffc2a38cd477 Mon Sep 17 00:00:00 2001 From: vrouvrea Date: Tue, 10 Apr 2018 15:44:18 +0000 Subject: Doc review : Add explanation when to use Alpha or Cech. git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/cechcomplex_vincent@3369 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 4b6cf58478a7dbe1825491681507d4304d8f3584 --- src/Cech_complex/doc/Intro_cech_complex.h | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) (limited to 'src/Cech_complex') diff --git a/src/Cech_complex/doc/Intro_cech_complex.h b/src/Cech_complex/doc/Intro_cech_complex.h index 4d88a1e9..c2844bac 100644 --- a/src/Cech_complex/doc/Intro_cech_complex.h +++ b/src/Cech_complex/doc/Intro_cech_complex.h @@ -27,7 +27,7 @@ namespace Gudhi { namespace cech_complex { -/** \defgroup cech_complex Cech complex +/** \defgroup cech_complex Čech complex * * \author Vincent Rouvreau * @@ -42,6 +42,10 @@ namespace cech_complex { * * The input shall be a point cloud in an Euclidean space. * + * \remark For people only interested in the topology of the \ref cech_complex (for instance persistence), + * \ref alpha_complex is equivalent to the \ref cech_complex and much smaller if you do not bound the radii. + * \ref cech_complex can still make sense in higher dimension precisely because you can bound the radii. + * * \subsection cechalgorithm Algorithm * * Cech_complex first builds a proximity graph from a point cloud. -- cgit v1.2.3