From 5ac9f8679bed60c6ec88b87f1ca56c0e48a42e4b Mon Sep 17 00:00:00 2001 From: Andreas Fabri Date: Mon, 27 Aug 2012 13:57:44 +0000 Subject: [PATCH] introduce a variable A --- Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_2.h | 4 ++-- Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_3.h | 8 ++++---- 2 files changed, 6 insertions(+), 6 deletions(-) diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_2.h index 63483596795..b4e38b5fb46 100644 --- a/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_2.h +++ b/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_2.h @@ -149,9 +149,9 @@ Alpha_shape_2(FT alpha = 0, Mode m = GENERAL); /*! -Builds an alpha shape of mode `m` from the triangulation `dt` +Builds an alpha shape `A` of mode `m` from the triangulation `dt` for a positive \f$ \alpha\f$-value `alpha`. -Be careful that this operation destroys the triangulation. +\attention This operation destroys the triangulation. \pre `alpha` \f$ \geq~0\f$. */ Alpha_shape_2( diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_3.h index 5e705e16c74..d4bfbec80a1 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_3.h @@ -151,16 +151,16 @@ Alpha_shape_3(FT alpha = 0, Mode m = REGULARIZED); /*! -Build an alpha shape of mode `m` +Build an alpha shape `A` of mode `m` from the triangulation `dt`. -Be careful that this operation destroys the triangulation. +\attention This operation destroys the triangulation `dt`. */ Alpha_shape_3(Dt& dt, FT alpha = 0, Mode m = REGULARIZED); /*! -Build an alpha shape data structure in mode `m` +Build an alpha shape data structure `A` in mode `m` for the points in the range \f$ \left[\right.\f$`first`, `last`\f$ \left.\right)\f$ and set the current alpha value to `alpha`. @@ -179,7 +179,7 @@ Mode m = REGULARIZED); /// @{ /*! -Initialize the alpha shape data structure +Initialize the alpha shape data structure `A` for points in the range \f$ \left[\right.\f$`first`, `last`\f$ \left.\right)\f$. Returns the number of data points inserted in the underlying