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

remove no longer relevant warning

This commit is contained in:
Sébastien Loriot 2016-12-29 12:06:02 +01:00
parent 1258b7fae4
commit 7e89c58fc5
2 changed files with 0 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
Convex_hull_3/doc/Convex_hull_3/CGAL/convex_hull_3.h
View File

@ -7,8 +7,6 @@ namespace CGAL {
[`first`, `last`). The polyhedron `pm` is cleared, then [`first`, `last`). The polyhedron `pm` is cleared, then
the convex hull is stored in `pm`. Note that the convex hull will be triangulated, the convex hull is stored in `pm`. Note that the convex hull will be triangulated,
that is `pm` will contain only triangular facets. that is `pm` will contain only triangular facets.
\attention This function does not compute the plane equations of the faces of `pm`.
\pre There are at least four points in the range \pre There are at least four points in the range
[`first`, `last`) not all of which are collinear. [`first`, `last`) not all of which are collinear.
@ -20,8 +18,6 @@ For the purposes of checking the postcondition that the convex hull
is valid, `Traits` must also be a model of the concept is valid, `Traits` must also be a model of the concept
`IsStronglyConvexTraits_3`. `IsStronglyConvexTraits_3`.
If the kernel `R` of the points determined by the value type of `InputIterator` If the kernel `R` of the points determined by the value type of `InputIterator`
is a kernel with exact predicates but inexact constructions is a kernel with exact predicates but inexact constructions
(in practice we check `R::Has_filtered_predicates_tag` is `Tag_true` and `R::FT` is a floating point type), (in practice we check `R::Has_filtered_predicates_tag` is `Tag_true` and `R::FT` is a floating point type),
@ -47,9 +43,6 @@ a triangle, or a polyhedron, is stored in `ch_object`.
In the case the result is a polyhedron, the convex hull will be triangulated, In the case the result is a polyhedron, the convex hull will be triangulated,
that is the polyhedron will contain only triangular facets. that is the polyhedron will contain only triangular facets.
\attention This function does not compute the plane equations of the faces of `pm`
in case the result is a polyhedron.
\tparam InputIterator must be an input iterator with a value type equivalent to `Traits::Point_3`. \tparam InputIterator must be an input iterator with a value type equivalent to `Traits::Point_3`.
\tparam Traits must be model of the concept `ConvexHullTraits_3`. \tparam Traits must be model of the concept `ConvexHullTraits_3`.
For the purposes of checking the postcondition that the convex hull For the purposes of checking the postcondition that the convex hull

2
Convex_hull_3/doc/Convex_hull_3/CGAL/convex_hull_3_to_face_graph.h
View File

@ -7,8 +7,6 @@ fills a polyhedron with the convex hull of a set of 3D points contained in a 3D
The polyhedron `pm` is cleared and the convex hull of the set of 3D points is stored in `pm`. The polyhedron `pm` is cleared and the convex hull of the set of 3D points is stored in `pm`.
\attention This function does not compute the plane equations of the faces of `pm`.
\pre `T.dimension()`==3. \pre `T.dimension()`==3.
\tparam Triangulation must be a \cgal 3D triangulation \tparam Triangulation must be a \cgal 3D triangulation