|
std::string | data_file_path (const std::string &filename) |
|
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) |
|
bool | do_intersect (Plane_3< Kernel > obj1, Plane_3< Kernel > obj2, Plane_3< Kernel > obj3) |
|
decltype(auto) | intersection (Type1< Kernel > obj1, Type2< Kernel > obj2) |
|
decltype(auto) | 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_2< Kernel > &s1s, const CGAL::Point_2< Kernel > &s1t, const CGAL::Point_2< Kernel > &s2s, const CGAL::Point_2< Kernel > &s2t) |
|
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_2< Kernel > | midpoint (const CGAL::Segment_2< Kernel > &s) |
|
CGAL::Point_3< Kernel > | midpoint (const CGAL::Point_3< Kernel > &p, const CGAL::Point_3< Kernel > &q) |
|
CGAL::Point_3< Kernel > | midpoint (const CGAL::Segment_3< Kernel > &s) |
|
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 | set_halfedgeds_items_id (Polyhedron_with_id &P) |
|
void | set_triangulation_ids (Triangulation &tr) |
|
Iterator_range< Halfedge_around_source_iterator< Graph > > | halfedges_around_source (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g) |
|
Iterator_range< Halfedge_around_source_iterator< Graph > > | halfedges_around_source (typename boost::graph_traits< Graph >::vertex_descriptor v, const Graph &g) |
|
Iterator_range< Halfedge_around_target_iterator< Graph > > | halfedges_around_target (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g) |
|
Iterator_range< Halfedge_around_target_iterator< Graph > > | halfedges_around_target (typename boost::graph_traits< Graph >::vertex_descriptor v, const Graph &g) |
|
Iterator_range< Halfedge_around_face_iterator< Graph > > | halfedges_around_face (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g) |
|
Iterator_range< Face_around_target_iterator< Graph > > | faces_around_target (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g) |
|
Iterator_range< Face_around_face_iterator< Graph > > | faces_around_face (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g) |
|
Iterator_range< Vertex_around_target_iterator< Graph > > | vertices_around_target (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g) |
|
Iterator_range< Vertex_around_face_iterator< Graph > > | vertices_around_face (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g) |
|
bool | is_border (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g) |
|
bool | is_border_edge (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g) |
|
bool | is_border (typename boost::graph_traits< FaceGraph >::edge_descriptor ed, const FaceGraph &g) |
|
boost::optional< typename boost::graph_traits< FaceGraph >::halfedge_descriptor > | is_border (typename boost::graph_traits< FaceGraph >::vertex_descriptor vd, const FaceGraph &g) |
|
bool | is_closed (const FaceGraph &g) |
|
bool | is_bivalent (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g) |
|
bool | is_bivalent_mesh (const FaceGraph &g) |
|
bool | is_trivalent (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g) |
|
bool | is_trivalent_mesh (const FaceGraph &g) |
|
bool | is_isolated_triangle (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g) |
|
bool | is_triangle (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g) |
|
bool | is_triangle_mesh (const FaceGraph &g) |
|
bool | is_isolated_quad (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g) |
|
bool | is_quad (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g) |
|
bool | is_quad_mesh (const FaceGraph &g) |
|
bool | is_tetrahedron (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g) |
|
bool | is_valid_halfedge_graph (const Graph &g, bool verb=false) |
|
bool | is_valid_face_graph (const Graph &g, bool verb=false) |
|
bool | is_valid_polygon_mesh (const Mesh &g, bool verb=false) |
|
bool | is_hexahedron (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g) |
|
void | clear (FaceGraph &g) |
|
bool | is_empty (const FaceGraph &g) |
|
int | vertex_index_in_face (const typename boost::graph_traits< Graph >::vertex_descriptor vd, const typename boost::graph_traits< Graph >::face_descriptor fd, const Graph &g) |
|
int | halfedge_index_in_face (typename boost::graph_traits< Graph >::halfedge_descriptor he, const Graph &g) |
|
boost::graph_traits< Graph >::halfedge_descriptor | make_triangle (const P &p0, const P &p1, const P &p2, Graph &g) |
|
boost::graph_traits< Graph >::halfedge_descriptor | make_quad (const P &p0, const P &p1, const P &p2, const P &p3, Graph &g) |
|
boost::graph_traits< Graph >::halfedge_descriptor | make_hexahedron (const P &p0, const P &p1, const P &p2, const P &p3, const P &p4, const P &p5, const P &p6, const P &p7, Graph &g) |
|
boost::graph_traits< Graph >::halfedge_descriptor | make_tetrahedron (const P &p0, const P &p1, const P &p2, const P &p3, Graph &g) |
|
boost::graph_traits< Graph >::halfedge_descriptor | make_regular_prism (typename boost::graph_traits< Graph >::vertices_size_type nb_vertices, Graph &g, const P &base_center=P(0, 0, 0), typename CGAL::Kernel_traits< P >::Kernel::FT height=1.0, typename CGAL::Kernel_traits< P >::Kernel::FT radius=1.0, bool is_closed=true) |
|
boost::graph_traits< Graph >::halfedge_descriptor | make_pyramid (typename boost::graph_traits< Graph >::vertices_size_type nb_vertices, Graph &g, const P &base_center=P(0, 0, 0), typename CGAL::Kernel_traits< P >::Kernel::FT height=1.0, typename CGAL::Kernel_traits< P >::Kernel::FT radius=1.0, bool is_closed=true) |
|
boost::graph_traits< Graph >::halfedge_descriptor | make_icosahedron (Graph &g, const P ¢er=P(0, 0, 0), typename CGAL::Kernel_traits< P >::Kernel::FT radius=1) |
|
boost::graph_traits< Graph >::halfedge_descriptor | make_grid (typename boost::graph_traits< Graph >::vertices_size_type i, typename boost::graph_traits< Graph >::vertices_size_type j, Graph &g, const CoordinateFunctor &calculator, bool triangulated=false) |
|
OutputIterator | expand_face_selection (const FaceRange &selection, FaceGraph &fg, unsigned int k, IsFaceSelectedPMap is_selected, OutputIterator out) |
|
OutputIterator | reduce_face_selection (const FaceRange &selection, FaceGraph &fg, unsigned int k, IsFaceSelectedPMap is_selected, OutputIterator out) |
|
void | regularize_face_selection_borders (TriangleMesh &mesh, IsSelectedMap is_selected, double weight, const NamedParameters &np=parameters::default_values()) |
|
OutputIterator | select_incident_faces (const HalfedgeRange &hedges, FaceGraph &fg, OutputIterator out) |
|
OutputIterator | expand_edge_selection (const EdgeRange &selection, HalfedgeGraph &fg, unsigned int k, IsEdgeSelectedPMap is_selected, OutputIterator out) |
|
OutputIterator | reduce_edge_selection (const EdgeRange &selection, HalfedgeGraph &fg, unsigned int k, IsEdgeSelectedPMap is_selected, OutputIterator out) |
|
OutputIterator | expand_vertex_selection (const VertexRange &selection, HalfedgeGraph &fg, unsigned int k, IsVertexSelectedPMap is_selected, OutputIterator out) |
|
OutputIterator | reduce_vertex_selection (const VertexRange &selection, HalfedgeGraph &fg, unsigned int k, IsVertexSelectedPMap is_selected, OutputIterator out) |
|
void | expand_face_selection_for_removal (const FaceRange &faces_to_be_deleted, TriangleMesh &tm, IsSelectedMap is_selected) |
|
void | split_graph_into_polylines (const Graph &graph, Visitor &polyline_visitor, IsTerminal is_terminal) |
|
void | copy_face_graph (const SourceMesh &sm, TargetMesh &tm, const NamedParameters1 &np1=parameters::default_values(), const NamedParameters2 &np2=parameters::default_values()) |
|
bool | read_off (std::istream &is, Graph &g, const NamedParameters &np=parameters::default_values()) |
|
bool | read_off (const char *fname, Graph &g, const NamedParameters &np=parameters::default_values()) |
|
bool | write_off (std::ostream &os, const Graph &g, const NamedParameters &np=parameters::default_values()) |
|
bool | write_off (const char *fname, const Graph &g, const NamedParameters &np=parameters::default_values()) |
|
bool | write_vtp (std::ostream &os, const Graph &g, const NamedParameters &np=parameters::default_values()) |
|
bool | write_wrl (std::ostream &os, const Graph &g, const NamedParameters &np=parameters::default_values()) |
|
double | alpha_expansion_graphcut (const InputGraph &input_graph, EdgeCostMap edge_cost_map, VertexLabelCostMap vertex_label_cost_map, VertexLabelMap vertex_label_map, const NamedParameters &np=parameters::default_values()) |
|
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) |
|
bool | output_surface_facets_to_off (std::ostream &os, const SurfaceMeshComplex_2InTriangulation_3 &c2t3, int options=Surface_mesher::IO_ORIENT_SURFACE) |
|
void | facets_in_complex_2_to_triangle_mesh (const C2T3 &c2t3, TriangleMesh &graph) |
|
bool | output_surface_facets_to_polyhedron (const SurfaceMeshComplex_2InTriangulation_3 &c2t3, Polyhedron &output_polyhedron) |
|
void | make_surface_mesh (SurfaceMeshC2T3 &c2t3, Surface surface, FacetsCriteria criteria, Tag tag, int initial_number_of_points=20) |
|
void | make_surface_mesh (SurfaceMeshC2T3 &c2t3, SurfaceMeshTraits::Surface_3 surface, SurfaceMeshTraits traits, FacetsCriteria criteria, Tag tag, int initial_number_of_points=20) |
|
void | draw (const T3 &at3) |
|
boost::graph_trait< FG >::vertex_descriptor | link_to_face_graph (const Triangulation &t, typename Triangulation::Vertex_handle vh, TriangleMesh &tm, bool no_infinite_faces=true) |
|
void | draw (const POLY &apoly) |
|
void | refine_Delaunay_mesh_2 (CDT &t, const Criteria &criteria=Criteria()) |
|
void | refine_Delaunay_mesh_2 (CDT &t, InputIterator begin, InputIterator end, const Criteria &criteria=Criteria(), bool mark=false) |
|
CGAL::Mesh_optimization_return_code | lloyd_optimize_mesh_2 (CDT &cdt, double parameters::time_limit=0, std::size_t parameters::max_iteration_number=0, double parameters::convergence=0.001, double parameters::freeze_bound=0.001, PointIterator parameters::seeds_begin=PointIterator(), PointIterator parameters::seeds_end=PointIterator(), bool parameters::mark=false) |
|
void | make_conforming_Delaunay_2 (CDT &t) |
|
void | make_conforming_Gabriel_2 (CDT &t) |
|
template<typename C3T3 > |
Mesh_optimization_return_code | exude_mesh_3 (C3T3 &c3t3, double parameters::time_limit=0, double parameters::sliver_bound=0) |
| The function exude_mesh_3() performs a sliver exudation process on a Delaunay mesh. More...
|
|
template<class C3T3 , class TriangleMesh > |
void | facets_in_complex_3_to_triangle_mesh (const C3T3 &c3t3, TriangleMesh &graph) |
| builds a TriangleMesh from the surface facets, with a consistent orientation at the interface of two subdomains. More...
|
|
template<typename C3T3 , typename MD > |
Mesh_optimization_return_code | lloyd_optimize_mesh_3 (C3T3 &c3t3, const MD &domain, double parameters::time_limit=0, std::size_t parameters::max_iteration_number=0, double parameters::convergence=0.02, double parameters::freeze_bound=0.01, bool parameters::do_freeze=true) |
| The function lloyd_optimize_mesh_3() is a mesh optimization process based on the minimization of a global energy function. More...
|
|
template<class C3T3 , class MD , class MC > |
C3T3 | make_mesh_3 (const MD &domain, const MC &criteria, parameters::internal::Features_options features=parameters::features(domain), parameters::internal::Lloyd_options lloyd=parameters::no_lloyd(), parameters::internal::Odt_options odt=parameters::no_odt(), parameters::internal::Perturb_options perturb=parameters::perturb(), parameters::internal::Exude_options exude=parameters::exude(), parameters::internal::Manifold_options manifold=parameters::non_manifold()) |
| The function make_mesh_3() is a 3D mesh generator. More...
|
|
template<typename C3T3 , typename MD > |
Mesh_optimization_return_code | odt_optimize_mesh_3 (C3T3 &c3t3, const MD &domain, double parameters::time_limit=0, std::size_t parameters::max_iteration_number=0, double parameters::convergence=0.02, double parameters::freeze_bound=0.01, bool parameters::do_freeze=true) |
| The function odt_optimize_mesh_3() is a mesh optimization process based on the minimization of a global energy function. More...
|
|
template<typename C3T3 , typename MD > |
Mesh_optimization_return_code | perturb_mesh_3 (C3T3 &c3t3, const MD &domain, double parameters::time_limit=0, double parameters::sliver_bound=0) |
| The function perturb_mesh_3() is a mesh optimizer that improves the quality of a Delaunay mesh by changing the positions of some vertices of the mesh. More...
|
|
template<class C3T3 , class MD , class MC > |
void | refine_mesh_3 (C3T3 &c3t3, const MD &mesh_domain, const MC &mesh_criteria, parameters::internal::Lloyd_options lloyd=parameters::no_lloyd(), parameters::internal::Odt_options odt=parameters::no_odt(), parameters::internal::Perturb_options perturb=parameters::perturb(), parameters::internal::Exude_options exude=parameters::exude(), parameters::internal::Manifold_options manifold=parameters::non_manifold()) |
| The function refine_mesh_3() is a 3D mesh generator. More...
|
|