|
| T | enum_cast (const U &u) |
| |
| Oriented_side | opposite (const Oriented_side &o) |
| |
| Bounded_side | opposite (const Bounded_side &o) |
| |
| bool | do_intersect (Type1< Kernel > obj1, Type2< Kernel > obj2) |
| |
| cpp11::result_of< Kernel::Intersect_23(Type1, Type2)>::type | intersection (Type1< Kernel > obj1, Type2< Kernel > obj2) |
| |
| boost::optional< boost::variant< Point_3, Line_3, Plane_3 > > | intersection (const Plane_3< Kernel > &pl1, const Plane_3< Kernel > &pl2, const Plane_3< Kernel > &pl3) |
| |
| Angle | angle (const CGAL::Vector_2< Kernel > &u, const CGAL::Vector_2< Kernel > &v) |
| |
| Angle | angle (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| Angle | angle (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s) |
| |
| Angle | angle (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v) |
| |
| Angle | angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| Angle | angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s) |
| |
| Angle | angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Vector_3< Kernel > &v) |
| |
| Kernel::FT | approximate_angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| Kernel::FT | approximate_angle (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v) |
| |
| Kernel::FT | approximate_dihedral_angle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s) |
| |
| Kernel::FT | area (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| bool | are_ordered_along_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| bool | are_ordered_along_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| bool | are_strictly_ordered_along_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| bool | are_strictly_ordered_along_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| CGAL::Point_2< Kernel > | barycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2) |
| |
| CGAL::Point_2< Kernel > | barycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2, const Kernel::FT &w2) |
| |
| CGAL::Point_2< Kernel > | barycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_2< Kernel > &p3) |
| |
| CGAL::Point_2< Kernel > | barycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_2< Kernel > &p3, const Kernel::FT &w3) |
| |
| CGAL::Point_2< Kernel > | barycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_2< Kernel > &p3, const Kernel::FT &w3, const CGAL::Point_2< Kernel > &p4) |
| |
| CGAL::Point_2< Kernel > | barycenter (const CGAL::Point_2< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_2< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_2< Kernel > &p3, const Kernel::FT &w3, const CGAL::Point_2< Kernel > &p4, const Kernel::FT &w4) |
| |
| CGAL::Point_3< Kernel > | barycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2) |
| |
| CGAL::Point_3< Kernel > | barycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2, const Kernel::FT &w2) |
| |
| CGAL::Point_3< Kernel > | barycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_3< Kernel > &p3) |
| |
| CGAL::Point_3< Kernel > | barycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_3< Kernel > &p3, const Kernel::FT &w3) |
| |
| CGAL::Point_3< Kernel > | barycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_3< Kernel > &p3, const Kernel::FT &w3, const CGAL::Point_3< Kernel > &p4) |
| |
| CGAL::Point_3< Kernel > | barycenter (const CGAL::Point_3< Kernel > &p1, const Kernel::FT &w1, const CGAL::Point_3< Kernel > &p2, const Kernel::FT &w2, const CGAL::Point_3< Kernel > &p3, const Kernel::FT &w3, const CGAL::Point_3< Kernel > &p4, const Kernel::FT &w4) |
| |
| CGAL::Line_2< Kernel > | bisector (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| CGAL::Line_2< Kernel > | bisector (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2) |
| |
| CGAL::Plane_3< Kernel > | bisector (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| CGAL::Plane_3< Kernel > | bisector (const CGAL::Plane_3< Kernel > &h1, const CGAL::Plane_3< Kernel > &h2) |
| |
| CGAL::Point_2< Kernel > | centroid (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| CGAL::Point_2< Kernel > | centroid (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s) |
| |
| CGAL::Point_2< Kernel > | centroid (const CGAL::Triangle_2< Kernel > &t) |
| |
| CGAL::Point_3< Kernel > | centroid (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| CGAL::Point_3< Kernel > | centroid (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s) |
| |
| CGAL::Point_3< Kernel > | centroid (const CGAL::Triangle_3< Kernel > &t) |
| |
| CGAL::Point_3< Kernel > | centroid (const CGAL::Tetrahedron_3< Kernel > &t) |
| |
| CGAL::Point_2< Kernel > | circumcenter (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| CGAL::Point_2< Kernel > | circumcenter (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| CGAL::Point_2< Kernel > | circumcenter (const CGAL::Triangle_2< Kernel > &t) |
| |
| CGAL::Point_3< Kernel > | circumcenter (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| CGAL::Point_3< Kernel > | circumcenter (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| CGAL::Point_3< Kernel > | circumcenter (const CGAL::Triangle_3< Kernel > &t) |
| |
| CGAL::Point_3< Kernel > | circumcenter (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s) |
| |
| CGAL::Point_3< Kernel > | circumcenter (const CGAL::Tetrahedron_3< Kernel > &t) |
| |
| bool | collinear_are_ordered_along_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| bool | collinear_are_ordered_along_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| bool | collinear_are_strictly_ordered_along_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| bool | collinear_are_strictly_ordered_along_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| bool | collinear (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| bool | collinear (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| Comparison_result | compare_dihedral_angle (const CGAL::Point_3< Kernel > &a1, const CGAL::Point_3< Kernel > &b1, const CGAL::Point_3< Kernel > &c1, const CGAL::Point_3< Kernel > &d1, const Kernel::FT &cosine) |
| |
| Comparison_result | compare_dihedral_angle (const CGAL::Point_3< Kernel > &a1, const CGAL::Point_3< Kernel > &b1, const CGAL::Point_3< Kernel > &c1, const CGAL::Point_3< Kernel > &d1, const CGAL::Point_3< Kernel > &a2, const CGAL::Point_3< Kernel > &b2, const CGAL::Point_3< Kernel > &c2, const CGAL::Point_3< Kernel > &d2) |
| |
| Comparison_result | compare_dihedral_angle (const CGAL::Vector_3< Kernel > &u1, const CGAL::Vector_3< Kernel > &v1, const CGAL::Vector_3< Kernel > &w1, const Kernel::FT &cosine) |
| |
| Comparison_result | compare_dihedral_angle (const CGAL::Vector_3< Kernel > &u1, const CGAL::Vector_3< Kernel > &v1, const CGAL::Vector_3< Kernel > &w1, const CGAL::Vector_3< Kernel > &u2, const CGAL::Vector_3< Kernel > &v2, const CGAL::Vector_3< Kernel > &w2) |
| |
| Comparison_result | compare_distance_to_point (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| Comparison_result | compare_distance_to_point (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| Comparison_result | compare_lexicographically (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| Comparison_result | compare_lexicographically (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| Comparison_result | compare_signed_distance_to_line (const CGAL::Line_2< Kernel > &l, const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| Comparison_result | compare_signed_distance_to_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s) |
| |
| Comparison_result | compare_signed_distance_to_plane (const CGAL::Plane_3< Kernel > &h, const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| Comparison_result | compare_signed_distance_to_plane (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const CGAL::Point_3< Kernel > &t) |
| |
| Comparison_result | compare_slope (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2) |
| |
| Comparison_result | compare_slope (const CGAL::Segment_2< Kernel > &s1, const CGAL::Segment_2< Kernel > &s2) |
| |
| Comparison_result | compare_slope (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s) |
| |
| Comparison_result | compare_squared_distance (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const typename Kernel::FT &d2) |
| |
| Comparison_result | compare_squared_distance (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const typename Kernel::FT &d2) |
| |
| Comparison_result | compare_squared_radius (const CGAL::Point_3< Kernel > &p, const typename Kernel::FT &sr) |
| |
| Comparison_result | compare_squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const typename Kernel::FT &sr) |
| |
| Comparison_result | compare_squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const typename Kernel::FT &sr) |
| |
| Comparison_result | compare_squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const typename Kernel::FT &sr) |
| |
| Comparison_result | compare_x (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| Comparison_result | compare_x (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| Comparison_result | compare_x (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2) |
| |
| Comparison_result | compare_x (const CGAL::Line_2< Kernel > &l, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2) |
| |
| Comparison_result | compare_x (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2) |
| |
| Comparison_result | compare_x (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Circular_arc_point_2< CircularKernel > &q) |
| |
| Comparison_result | compare_x (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Point_2< CircularKernel > &q) |
| |
| Comparison_result | compare_x (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q) |
| |
| Comparison_result | compare_x (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q) |
| |
| Comparison_result | compare_xy (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| Comparison_result | compare_xy (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| Comparison_result | compare_xy (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Circular_arc_point_2< CircularKernel > &q) |
| |
| Comparison_result | compare_xy (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Point_2< CircularKernel > &q) |
| |
| Comparison_result | compare_xy (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q) |
| |
| Comparison_result | compare_xy (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q) |
| |
| Comparison_result | compare_x_at_y (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &h) |
| |
| Comparison_result | compare_x_at_y (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2) |
| |
| Comparison_result | compare_x_at_y (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h) |
| |
| Comparison_result | compare_x_at_y (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2) |
| |
| Comparison_result | compare_y_at_x (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &h) |
| |
| Comparison_result | compare_y_at_x (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2) |
| |
| Comparison_result | compare_y_at_x (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h) |
| |
| Comparison_result | compare_y_at_x (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2) |
| |
| Comparison_result | compare_y_at_x (const CGAL::Point_2< Kernel > &p, const CGAL::Segment_2< Kernel > &s) |
| |
| Comparison_result | compare_y_at_x (const CGAL::Point_2< Kernel > &p, const CGAL::Segment_2< Kernel > &s1, const CGAL::Segment_2< Kernel > &s2) |
| |
| Comparison_result | compare_y (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| Comparison_result | compare_y (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| Comparison_result | compare_y (const CGAL::Point_2< Kernel > &p, const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2) |
| |
| Comparison_result | compare_y (const CGAL::Line_2< Kernel > &l, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2) |
| |
| Comparison_result | compare_y (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2, const CGAL::Line_2< Kernel > &h1, const CGAL::Line_2< Kernel > &h2) |
| |
| Comparison_result | compare_y (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Circular_arc_point_2< CircularKernel > &q) |
| |
| Comparison_result | compare_y (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Point_2< CircularKernel > &q) |
| |
| Comparison_result | compare_y (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q) |
| |
| Comparison_result | compare_y (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q) |
| |
| Comparison_result | compare_xyz (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| Comparison_result | compare_xyz (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q) |
| |
| Comparison_result | compare_xyz (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q) |
| |
| Comparison_result | compare_z (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| Comparison_result | compare_z (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q) |
| |
| Comparison_result | compare_z (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Point_3< SphericalKernel > &q) |
| |
| Comparison_result | compare_yx (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| bool | coplanar (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s) |
| |
| Orientation | coplanar_orientation (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s) |
| |
| Orientation | coplanar_orientation (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| Bounded_side | coplanar_side_of_bounded_circle (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s) |
| |
| CGAL::Vector_3< Kernel > | cross_product (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v) |
| |
| Kernel::FT | determinant (const CGAL::Vector_2< Kernel > &v, const CGAL::Vector_2< Kernel > &w) |
| |
| Kernel::FT | determinant (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v, const CGAL::Vector_3< Kernel > &w) |
| |
| CGAL::Line_3< Kernel > | equidistant_line (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| bool | has_larger_distance_to_point (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| bool | has_larger_distance_to_point (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| bool | has_larger_signed_distance_to_line (const CGAL::Line_2< Kernel > &l, const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| bool | has_larger_signed_distance_to_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s) |
| |
| bool | has_larger_signed_distance_to_plane (const CGAL::Plane_3< Kernel > &h, const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| bool | has_larger_signed_distance_to_plane (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const CGAL::Point_3< Kernel > &t) |
| |
| bool | has_smaller_distance_to_point (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| bool | has_smaller_distance_to_point (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| bool | has_smaller_signed_distance_to_line (const CGAL::Line_2< Kernel > &l, const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| bool | has_smaller_signed_distance_to_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s) |
| |
| bool | has_smaller_signed_distance_to_plane (const CGAL::Plane_3< Kernel > &h, const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| bool | has_smaller_signed_distance_to_plane (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const CGAL::Point_3< Kernel > &t) |
| |
| Kernel::FT | l_infinity_distance (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| Kernel::FT | l_infinity_distance (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| bool | left_turn (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| bool | lexicographically_xy_larger (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| bool | lexicographically_xy_larger_or_equal (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| bool | lexicographically_xy_smaller (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| bool | lexicographically_xy_smaller_or_equal (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| bool | lexicographically_xyz_smaller (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| bool | lexicographically_xyz_smaller_or_equal (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| CGAL::Point_2< Kernel > | max_vertex (const CGAL::Iso_rectangle_2< Kernel > &ir) |
| |
| CGAL::Point_3< Kernel > | max_vertex (const CGAL::Iso_cuboid_3< Kernel > &ic) |
| |
| CGAL::Point_2< Kernel > | midpoint (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| CGAL::Point_3< Kernel > | midpoint (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| CGAL::Point_2< Kernel > | min_vertex (const CGAL::Iso_rectangle_2< Kernel > &ir) |
| |
| CGAL::Point_3< Kernel > | min_vertex (const CGAL::Iso_cuboid_3< Kernel > &ic) |
| |
| CGAL::Vector_3< Kernel > | normal (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| Orientation | orientation (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| Orientation | orientation (const CGAL::Vector_2< Kernel > &u, const CGAL::Vector_2< Kernel > &v) |
| |
| Orientation | orientation (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s) |
| |
| Orientation | orientation (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v, const CGAL::Vector_3< Kernel > &w) |
| |
| CGAL::Vector_3< Kernel > | orthogonal_vector (const CGAL::Plane_3< Kernel > &p) |
| |
| CGAL::Vector_3< Kernel > | orthogonal_vector (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| bool | parallel (const CGAL::Line_2< Kernel > &l1, const CGAL::Line_2< Kernel > &l2) |
| |
| bool | parallel (const CGAL::Ray_2< Kernel > &r1, const CGAL::Ray_2< Kernel > &r2) |
| |
| bool | parallel (const CGAL::Segment_2< Kernel > &s1, const CGAL::Segment_2< Kernel > &s2) |
| |
| bool | parallel (const CGAL::Line_3< Kernel > &l1, const CGAL::Line_3< Kernel > &l2) |
| |
| bool | parallel (const CGAL::Plane_3< Kernel > &h1, const CGAL::Plane_3< Kernel > &h2) |
| |
| bool | parallel (const CGAL::Ray_3< Kernel > &r1, const CGAL::Ray_3< Kernel > &r2) |
| |
| bool | parallel (const CGAL::Segment_3< Kernel > &s1, const CGAL::Segment_3< Kernel > &s2) |
| |
| CGAL::Plane_3< Kernel > | radical_plane (const CGAL::Sphere_3< Kernel > &s1, const CGAL::Sphere_3< Kernel > &s2) |
| |
| CGAL::Line_2< Kernel > | radical_line (const CGAL::Circle_2< Kernel > &c1, const CGAL::Circle_2< Kernel > &c2) |
| |
| bool | right_turn (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| Kernel::FT | scalar_product (const CGAL::Vector_2< Kernel > &u, const CGAL::Vector_2< Kernel > &v) |
| |
| Kernel::FT | scalar_product (const CGAL::Vector_3< Kernel > &u, const CGAL::Vector_3< Kernel > &v) |
| |
| Bounded_side | side_of_bounded_circle (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &t) |
| |
| Bounded_side | side_of_bounded_circle (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &t) |
| |
| Bounded_side | side_of_bounded_sphere (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const CGAL::Point_3< Kernel > &t) |
| |
| Bounded_side | side_of_bounded_sphere (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &t) |
| |
| Bounded_side | side_of_bounded_sphere (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &t) |
| |
| Oriented_side | side_of_oriented_circle (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &test) |
| |
| Oriented_side | side_of_oriented_sphere (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s, const CGAL::Point_3< Kernel > &test) |
| |
| Kernel::FT | squared_area (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| FT | squared_radius (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r) |
| |
| FT | squared_radius (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| FT | squared_radius (const CGAL::Point_2< Kernel > &p) |
| |
| FT | squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r, const CGAL::Point_3< Kernel > &s) |
| |
| FT | squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| FT | squared_radius (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| FT | squared_radius (const CGAL::Point_3< Kernel > &p) |
| |
| CGAL::Vector_3< Kernel > | unit_normal (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q, const CGAL::Point_3< Kernel > &r) |
| |
| Kernel::FT | volume (const CGAL::Point_3< Kernel > &p0, const CGAL::Point_3< Kernel > &p1, const CGAL::Point_3< Kernel > &p2, const CGAL::Point_3< Kernel > &p3) |
| |
| bool | x_equal (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| bool | x_equal (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| bool | y_equal (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q) |
| |
| bool | y_equal (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| bool | z_equal (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
| |
| void | rational_rotation_approximation (const RingNumberType &dirx, const RingNumberType &diry, RingNumberType &sin_num, RingNumberType &cos_num, RingNumberType &denom, const RingNumberType &eps_num, const RingNumberType &eps_den) |
| |
| Kernel::FT | squared_distance (Type1< Kernel > obj1, Type2< Kernel > obj2) |
| |
| Point_2< Homogeneous< RT > > | cartesian_to_homogeneous (const Point_2< Cartesian< RT > > &cp) |
| |
| Point_3< Homogeneous< RT > > | cartesian_to_homogeneous (const Point_3< Cartesian< RT > > &cp) |
| |
| Point_2< Cartesian< FT > > | homogeneous_to_cartesian (const Point_2< Homogeneous< FT > > &hp) |
| |
| Point_3< Cartesian< FT > > | homogeneous_to_cartesian (const Point_3< Homogeneous< FT > > &hp) |
| |
| Point_2< Cartesian< Quotient< RT > > > | homogeneous_to_quotient_cartesian (const Point_2< Homogeneous< RT > > &hp) |
| |
| Point_3< Cartesian< Quotient< RT > > > | homogeneous_to_quotient_cartesian (const Point_3< Homogeneous< RT > > &hp) |
| |
| Point_2< Homogeneous< RT > > | quotient_cartesian_to_homogeneous (const Point_2< Cartesian< Quotient< RT > > > &cp) |
| |
| Point_3< Homogeneous< RT > > | quotient_cartesian_to_homogeneous (const Point_3< Cartesian< Quotient< RT > > > &cp) |
| |
| bool | do_intersect (Type1< CircularKernel > obj1, Type2< CircularKernel > obj2) |
| |
| OutputIterator | intersection (const Type1 &obj1, const Type2 &obj2, OutputIterator intersections) |
| |
| Comparison_result | compare_y_at_x (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Circular_arc_2< CircularKernel > &a) |
| |
| Comparison_result | compare_y_at_x (const CGAL::Circular_arc_point_2< CircularKernel > &p, const CGAL::Line_arc_2< CircularKernel > &a) |
| |
| bool | do_intersect (Type1< SphericalKernel > obj1, Type2< SphericalKernel > obj2) |
| |
| bool | do_intersect (Type1< SphericalKernel > obj1, Type2< SphericalKernel > obj2, Type3< SphericalKernel > obj3) |
| |
| OutputIterator | intersection (const SphericalType1 &obj1, const SphericalType2 &obj2, OutputIterator intersections) |
| |
| OutputIterator | intersection (const Type1 &obj1, const Type2 &obj2, const Type3 &obj3, OutputIterator intersections) |
| |
| OutputIterator | copy_n (InputIterator first, Size n, OutputIterator result) |
| |
| std::pair< ForwardIterator, ForwardIterator > | min_max_element (ForwardIterator first, ForwardIterator last) |
| |
| std::pair< ForwardIterator, ForwardIterator > | min_max_element (ForwardIterator first, ForwardIterator last, CompareMin comp_min, CompareMax comp_max) |
| |
| BidirectionalIterator | predecessor (BidirectionalIterator it) |
| |
| ForwardIterator | successor (ForwardIterator it) |
| |
| std::array< T, N > | make_array (const T &...) |
| |
| CC_safe_handle< CC_iterator > | make_cc_safe_handle (CC_iterator iterator) |
| |
| Compare_to_less< F > | compare_to_less (const F &f) |
| |
| Iterator_range< T > | make_range (const T &b, const T &e) |
| |
| T | range_begin (Iterator_range< T > &x) |
| |
| T | range_end (Iterator_range< T > &x) |
| |
| T | range_begin (const Iterator_range< T > &x) |
| |
| T | range_end (const Iterator_range< T > &x) |
| |
| Failure_function | set_error_handler (Failure_function handler) |
| |
| Failure_function | set_warning_handler (Failure_function handler) |
| |
| Failure_behaviour | set_error_behaviour (Failure_behaviour eb) |
| |
| Failure_behaviour | set_warning_behaviour (Failure_behaviour eb) |
| |
| NT | abs (const NT &x) |
| |
| result_type | compare (const NT &x, const NT &y) |
| |
| result_type | div (const NT1 &x, const NT2 &y) |
| |
| void | div_mod (const NT1 &x, const NT2 &y, result_type &q, result_type &r) |
| |
| result_type | gcd (const NT1 &x, const NT2 &y) |
| |
| result_type | integral_division (const NT1 &x, const NT2 &y) |
| |
| NT | inverse (const NT &x) |
| |
| result_type | is_negative (const NT &x) |
| |
| result_type | is_one (const NT &x) |
| |
| result_type | is_positive (const NT &x) |
| |
| result_type | is_square (const NT &x) |
| |
| result_type | is_square (const NT &x, NT &y) |
| |
| result_type | is_zero (const NT &x) |
| |
| NT | kth_root (int k, const NT &x) |
| |
| result_type | mod (const NT1 &x, const NT2 &y) |
| |
| NT | root_of (int k, InputIterator begin, InputIterator end) |
| |
| result_type | sign (const NT &x) |
| |
| void | simplify (const NT &x) |
| |
| NT | sqrt (const NT &x) |
| |
| NT | square (const NT &x) |
| |
| double | to_double (const NT &x) |
| |
| std::pair< double, double > | to_interval (const NT &x) |
| |
| NT | unit_part (const NT &x) |
| |
| void | Assert_circulator (const C &c) |
| |
| void | Assert_iterator (const I &i) |
| |
| void | Assert_circulator_or_iterator (const IC &i) |
| |
| void | Assert_input_category (const I &i) |
| |
| void | Assert_output_category (const I &i) |
| |
| void | Assert_forward_category (const IC &ic) |
| |
| void | Assert_bidirectional_category (const IC &ic) |
| |
| void | Assert_random_access_category (const IC &ic) |
| |
| C::difference_type | circulator_distance (C c, C d) |
| |
| C::size_type | circulator_size (C c) |
| |
| bool | is_empty_range (const IC &i, const IC &j) |
| |
| iterator_traits< IC >::difference_type | iterator_distance (IC ic1, IC ic2) |
| |
| Iterator_tag | query_circulator_or_iterator (const I &i) |
| |
| Circulator_tag | query_circulator_or_iterator (const C &c) |
| |
| void | draw (const T2 &at2) |
| |
| template<class InputIterator , class Traits > |
| bool | is_y_monotone_2 (InputIterator first, InputIterator beyond, const Traits &traits) |
| |
| template<class InputIterator , class OutputIterator , class Traits > |
| OutputIterator | approx_convex_partition_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &traits=Default_traits) |
| | computes a partition of the polygon defined by the points in the range [first, beyond) into convex polygons. The counterclockwise-oriented partition polygons are written to the sequence starting at position result. The past-the-end iterator for the resulting sequence of polygons is returned. More...
|
| |
| template<class InputIterator , class OutputIterator , class Traits > |
| OutputIterator | greene_approx_convex_partition_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &traits=Default_traits) |
| | computes a partition of the polygon defined by the points in the range [first, beyond) into convex polygons. The counterclockwise-oriented partition polygons are written to the sequence starting at position result. The number of convex polygons produced is no more than four times the minimal number. The past-the-end iterator for the resulting sequence of polygons is returned. More...
|
| |
| template<class InputIterator , class OutputIterator , class Traits > |
| OutputIterator | optimal_convex_partition_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &traits=Default_traits) |
| | computes a partition of the polygon defined by the points in the range [first, beyond) into convex polygons. The counterclockwise-oriented partition polygons are written to the sequence starting at position result. The number of convex polygons produced is minimal. The past-the-end iterator for the resulting sequence of polygons is returned. More...
|
| |
| template<class InputIterator , class OutputIterator , class Traits > |
| OutputIterator | y_monotone_partition_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &traits=Default_traits) |
| | computes a partition of the polygon defined by the points in the range [first, beyond) into \( y\)-monotone polygons. The counterclockwise-oriented partition polygons are written to the sequence starting at position result. The past-the-end iterator for the resulting sequence of polygons is returned. More...
|
| |
| template<class InputIterator , class ForwardIterator , class Traits > |
| bool | convex_partition_is_valid_2 (InputIterator point_first, InputIterator point_beyond, ForwardIterator poly_first, ForwardIterator poly_beyond, const Traits &traits=Default_traits) |
| | determines if the polygons in the range [poly_first, poly_beyond) define a valid convex partition of the polygon defined by the points in the range [point_first, point_beyond). A convex partition is valid if the polygons do not overlap, the union of the polygons is the same as the original polygon given by the sequence of points, and if each partition polygon is convex. The function returns true iff the partition is valid and otherwise returns false. More...
|
| |
| template<class InputIterator , class ForwardIterator , class Traits > |
| bool | partition_is_valid_2 (InputIterator point_first, InputIterator point_beyond, ForwardIterator poly_first, ForwardIterator poly_beyond, const Traits &traits=Default_traits) |
| | returns true iff the polygons in the range [poly_first, poly_beyond) define a valid partition of the polygon defined by the points in the range [point_first, point_beyond) and false otherwise. A valid partition is one in which the polygons are nonoverlapping and the union of the polygons is the same as the original polygon. Each polygon must also satisfy the property tested by Traits::Is_valid(). More...
|
| |
| template<class InputIterator , class ForwardIterator , class Traits > |
| bool | y_monotone_partition_is_valid_2 (InputIterator point_first, InputIterator point_beyond, ForwardIterator poly_first, ForwardIterator poly_beyond, const Traits &traits=Default_traits) |
| | determines if the polygons in the range [poly_first, poly_beyond) define a valid \( y\)-monotone partition of the simple, counterclockwise-oriented polygon represented by the points in the range [point_first, point_beyond). A valid partition is one in which the polygons are nonoverlapping and the union of the polygons is the same as the original polygon and each polygon is \( y\)-monotone More...
|
| |