songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'Triangulation-add_regular_tri-cjamin_mglisse' of github.com:CGAL/INRIA into Triangulation-add_regular_tri-cjamin_mglisse

This commit is contained in:
Clement Jamin 2017-01-16 10:56:59 +01:00
parent 8b90573da4 9275cbc204
commit b2b481e6c5
1 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
Kernel_d/doc/Kernel_d/CGAL/Epick_d.h
View File

@ -94,7 +94,8 @@ double weight() const;
/*! \cgalModels `Kernel_d::Center_of_sphere_d` /*! \cgalModels `Kernel_d::Center_of_sphere_d`
*/ */
struct Construct_circumcenter_d { class Construct_circumcenter_d {
public:
/*! returns the center of the sphere defined by `A=tuple[first,last)`. The sphere is centered in the affine hull of A and passes through all the points of A. The order of the points of A does not matter. /*! returns the center of the sphere defined by `A=tuple[first,last)`. The sphere is centered in the affine hull of A and passes through all the points of A. The order of the points of A does not matter.
\pre A is affinely independant. \pre A is affinely independant.
\tparam ForwardIterator has `Epick_d::Point_d` as value type. \tparam ForwardIterator has `Epick_d::Point_d` as value type.
@ -102,7 +103,8 @@ struct Construct_circumcenter_d {
template<typename ForwardIterator> template<typename ForwardIterator>
Point_d operator()(ForwardIterator first, ForwardIterator last); Point_d operator()(ForwardIterator first, ForwardIterator last);
}; };
struct Compute_squared_radius_d { class Compute_squared_radius_d {
public:
/*! returns the radius of the sphere defined by `A=tuple[first,last)`. The sphere is centered in the affine hull of A and passes through all the points of A. The order of the points of A does not matter. /*! returns the radius of the sphere defined by `A=tuple[first,last)`. The sphere is centered in the affine hull of A and passes through all the points of A. The order of the points of A does not matter.
\pre A is affinely independant. \pre A is affinely independant.
\tparam ForwardIterator has `Epick_d::Point_d` as value type. \tparam ForwardIterator has `Epick_d::Point_d` as value type.
@ -112,7 +114,8 @@ Point_d operator()(ForwardIterator first, ForwardIterator last);
}; };
/*! \cgalModels `Kernel_d::Side_of_bounded_sphere_d` /*! \cgalModels `Kernel_d::Side_of_bounded_sphere_d`
*/ */
struct Side_of_bounded_sphere_d { class Side_of_bounded_sphere_d {
public:
/*! returns the relative position of point p to the sphere defined by `A=tuple[first,last)`. The sphere is centered in the affine hull of A and passes through all the points of A. The order of the points of A does not matter. /*! returns the relative position of point p to the sphere defined by `A=tuple[first,last)`. The sphere is centered in the affine hull of A and passes through all the points of A. The order of the points of A does not matter.
\pre A is affinely independant. \pre A is affinely independant.
\tparam ForwardIterator has `Epick_d::Point_d` as value type. \tparam ForwardIterator has `Epick_d::Point_d` as value type.