2 files changed, 11 insertions, 3 deletions
diff --git a/src/Alpha_complex/doc/Intro_alpha_complex.h b/src/Alpha_complex/doc/Intro_alpha_complex.h
index a08663ca..a1092068 100644
--- a/src/Alpha_complex/doc/Intro_alpha_complex.h
+++ b/src/Alpha_complex/doc/Intro_alpha_complex.h
@@ -57,9 +57,13 @@ namespace alpha_complex {
  * href="http://doc.cgal.org/latest/Kernel_d/index.html#Chapter_dD_Geometry_Kernel">dD Geometry Kernel</a>
  * \cite cgal:s-gkd-15b from CGAL as template parameter.
  * 
- * \remark When the simplicial complex is constructed with an infinite value of alpha, the complex is a Delaunay
+ * \remark
+ * - When the simplicial complex is constructed with an infinite value of alpha, the complex is a Delaunay
  * complex.
- * 
+ * - For people only interested in the topology of the \ref alpha_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.
+ *
  * \section pointsexample Example from points
  * 
  * This example builds the Delaunay triangulation from the given points in a 2D static kernel, and creates a
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.