From 97460e6058ab032fefb13289eb29c97d4d106bf8 Mon Sep 17 00:00:00 2001 From: vrouvrea Date: Tue, 10 Apr 2018 07:30:38 +0000 Subject: Doc review : Separate global definition and a new section algorithm. git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/cechcomplex_vincent@3360 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 88289d011e416c3b3d66faffbcaa3e07b910314c --- src/Cech_complex/doc/Intro_cech_complex.h | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'src') diff --git a/src/Cech_complex/doc/Intro_cech_complex.h b/src/Cech_complex/doc/Intro_cech_complex.h index 244609a9..4d88a1e9 100644 --- a/src/Cech_complex/doc/Intro_cech_complex.h +++ b/src/Cech_complex/doc/Intro_cech_complex.h @@ -35,16 +35,16 @@ namespace cech_complex { * * \section cechdefinition Čech complex definition * - * Cech_complex + * Čech complex * (Wikipedia) is a - * proximity graph that allows to construct a - * simplicial complex - * from it. + * simplicial complex constructed + * from a proximity graph. The set of all simplices is filtered by the radius of their minimal enclosing ball. * * The input shall be a point cloud in an Euclidean space. * * \subsection cechalgorithm Algorithm * + * Cech_complex first builds a proximity graph from a point cloud. * The filtration value of each edge of the `Gudhi::Proximity_graph` is computed from * `Gudhi::Minimal_enclosing_ball_radius` function. * -- cgit v1.2.3