|
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) |
|
bool | is_finite (double x) |
|
bool | is_finite (float x) |
|
bool | is_finite (long double x) |
|
OutputIterator | compute_roots_of_2 (const RT &a, const RT &b, const RT &c, OutputIterator oit) |
|
Root_of_traits< RT >::Root_of_2 | make_root_of_2 (const RT &a, const RT &b, const RT &c, bool s) |
|
Root_of_traits< RT >::Root_of_2 | make_root_of_2 (RT alpha, RT beta, RT gamma) |
|
Root_of_traits< RT >::Root_of_2 | make_sqrt (const RT &x) |
|
Rational | simplest_rational_in_interval (double d1, double d2) |
|
Rational | to_rational (double d) |
|
bool | is_valid (const T &x) |
|
T | max (const T &x, const T &y) |
|
T | min (const T &x, const T &y) |
|
Polynomial_traits_d< Polynomial_d >::Canonicalize::result_type | canonicalize (const Polynomial_d &p) |
|
Polynomial_traits_d< Polynomial_d >::Compare::result_type | compare (const Polynomial_d &p, const Polynomial_d &q) |
|
Polynomial_traits_d< Polynomial_d >::Degree::result_type | degree (const Polynomial_d &p, int i, index=Polynomial_traits_d< Polynomial_d >::d-1) |
|
Polynomial_traits_d< Polynomial_d >::Degree_vector::result_type | degree_vector (const Polynomial_d &p) |
|
Polynomial_traits_d< Polynomial_d >::Differentiate::result_type | differentiate (const Polynomial_d &p, index=Polynomial_traits_d< Polynomial_d >::d-1) |
|
Polynomial_traits_d< Polynomial_d >::Evaluate_homogeneous::result_type | evaluate_homogeneous (const Polynomial_d &p, Polynomial_traits_d< Polynomial_d >::Coefficient_type u, Polynomial_traits_d< Polynomial_d >::Coefficient_type v) |
|
Polynomial_traits_d< Polynomial_d >::Evaluate::result_type | evaluate (const Polynomial_d &p, Polynomial_traits_d< Polynomial_d >::Coefficient_type x) |
|
Polynomial_traits_d< Polynomial_d >::Gcd_up_to_constant_factor::result_type | gcd_up_to_constant_factor (const Polynomial_d &p, const Polynomial_d &q) |
|
Polynomial_traits_d< Polynomial_d >::get_coefficient::result_type | get_coefficient (const Polynomial_d &p, int i) |
|
Polynomial_traits_d< Polynomial_d >::get_innermost_coefficient::result_type | get_innermost_coefficient (const Polynomial_d &p, Exponent_vector ev) |
|
Polynomial_traits_d< Polynomial_d >::Innermost_leading_coefficient::result_type | innermost_leading_coefficient (const Polynomial_d &p) |
|
Polynomial_traits_d< Polynomial_d >::Integral_division_up_to_constant_factor::result_type | integral_division_up_to_constant_factor (const Polynomial_d &p, const Polynomial_d &q) |
|
Polynomial_traits_d< Polynomial_d >::Invert::result_type | invert (const Polynomial_d &p, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
|
Polynomial_traits_d< Polynomial_d >::Is_square_free::result_type | is_square_free (const Polynomial_d &p) |
|
Polynomial_traits_d< Polynomial_d >::Is_zero_at_homogeneous::result_type | is_zero_at_homogeneous (const Polynomial_d &p, InputIterator begin, InputIterator end) |
|
Polynomial_traits_d< Polynomial_d >::Is_zero_at::result_type | is_zero_at (const Polynomial_d &p, InputIterator begin, InputIterator end) |
|
Polynomial_traits_d< Polynomial_d >::Leading_coefficient::result_type | leading_coefficient (const Polynomial_d &p) |
|
Polynomial_traits_d< Polynomial_d >::Make_square_free::result_type | make_square_free (const Polynomial_d &p) |
|
Polynomial_traits_d< Polynomial_d >::Move::result_type | move (const Polynomial_d &p, int i, int j) |
|
Polynomial_traits_d< Polynomial_d >::Multivariate_content::result_type | multivariate_content (const Polynomial_d &p) |
|
Polynomial_traits_d< Polynomial_d >::Negate::result_type | negate (const Polynomial_d &p, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
|
int | number_of_real_roots (Polynomial_d f) |
|
int | number_of_real_roots (InputIterator start, InputIterator end) |
|
Polynomial_traits_d< Polynomial_d >::Permute::result_type | permute (const Polynomial_d &p, InputIterator begin, InputIterator end) |
|
OutputIterator | polynomial_subresultants (Polynomial_d p, Polynomial_d q, OutputIterator out) |
|
OutputIterator1 | polynomial_subresultants_with_cofactors (Polynomial_d p, Polynomial_d q, OutputIterator1 sres_out, OutputIterator2 coP_out, OutputIterator3 coQ_out) |
|
OutputIterator | principal_sturm_habicht_sequence (typename Polynomial_d f, OutputIterator out) |
|
OutputIterator | principal_subresultants (Polynomial_d p, Polynomial_d q, OutputIterator out) |
|
void | pseudo_division (const Polynomial_d &f, const Polynomial_d &g, Polynomial_d &q, Polynomial_d &r, Polynomial_traits_d< Polynomial_d >::Coefficient_type &D) |
|
Polynomial_traits_d< Polynomial_d >::Pseudo_division_quotient::result_type | pseudo_division_quotient (const Polynomial_d &p, const Polynomial_d &q) |
|
Polynomial_traits_d< Polynomial_d >::Pseudo_division_remainder::result_type | pseudo_division_remainder (const Polynomial_d &p, const Polynomial_d &q) |
|
Polynomial_traits_d< Polynomial_d >::Resultant::result_type | resultant (const Polynomial_d &p, const Polynomial_d &q) |
|
Polynomial_traits_d< Polynomial_d >::Scale_homogeneous::result_type | scale_homogeneous (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &u, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &v, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
|
Polynomial_traits_d< Polynomial_d >::Scale::result_type | scale (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &a, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
|
Polynomial_traits_d< Polynomial_d >::Shift::result_type | shift (const Polynomial_d &p, int i, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
|
Polynomial_traits_d< Polynomial_d >::Sign_at_homogeneous::result_type | sign_at_homogeneous (const Polynomial_d &p, InputIterator begin, InputIterator end) |
|
Polynomial_traits_d< Polynomial_d >::Sign_at::result_type | sign_at (const Polynomial_d &p, InputIterator begin, InputIterator end) |
|
OutputIterator | square_free_factorize (const Polynomial_d &p, OutputIterator it, Polynomial_traits_d< Polynomial >::Innermost_coefficient &a) |
|
OutputIterator | square_free_factorize (const Polynomial_d &p, OutputIterator it) |
|
OutputIterator | square_free_factorize_up_to_constant_factor (const Polynomial_d &p, OutputIterator it) |
|
OutputIterator | sturm_habicht_sequence (Polynomial_d f, OutputIterator out) |
|
OutputIterator1 | sturm_habicht_sequence_with_cofactors (Polynomial_d f, OutputIterator1 stha_out, OutputIterator2 cof_out, OutputIterator3 cofx_out) |
|
CGAL::Coercion_traits< Polynomial_traits_d< Polynomial_d >::Innermost_coefficient, std::iterator_traits< Input_iterator >::value_type >::Type | substitute_homogeneous (const Polynomial_d &p, InputIterator begin, InputIterator end) |
|
CGAL::Coercion_traits< Polynomial_traits_d< Polynomial_d >::Innermost_coefficient, std::iterator_traits< Input_iterator >::value_type >::Type | substitute (const Polynomial_d &p, InputIterator begin, InputIterator end) |
|
Polynomial_traits_d< Polynomial_d >::Swap::result_type | swap (const Polynomial_d &p, int i, int j) |
|
Polynomial_traits_d< Polynomial_d >::Total_degree::result_type | total_degree (const Polynomial_d &p) |
|
Polynomial_traits_d< Polynomial_d >::Translate_homogeneous::result_type | translate_homogeneous (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &u, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &v, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
|
Polynomial_traits_d< Polynomial_d >::Translate::result_type | translate (const Polynomial_d &p, const Polynomial_traits_d< Polynomial_d >::Innermost_coefficient_type &a, int index=Polynomial_traits_d< Polynomial_d >::d-1) |
|
Polynomial_traits_d< Polynomial_d >::Univariate_content::result_type | univariate_content (const Polynomial_d &p) |
|
Polynomial_traits_d< Polynomial_d >::Univariate_content_up_to_constant_factor::result_type | univariate_content_up_to_constant_factor (const Polynomial_d &p) |
|
void | monotone_matrix_search (const Matrix &m, RandomAccessIC t, const Compare_strictly &compare_strictly=less< Matrix::Value >()) |
|
Traits::Value | sorted_matrix_search (RandomAccessIterator f, RandomAccessIterator l, const Traits &t) |
|
void | print_linear_program (std::ostream &out, const LinearProgram &lp, const std::string &problem_name=std::string("MY_MPS")) |
|
void | print_nonnegative_linear_program (std::ostream &out, const NonnegativeLinearProgram &lp, const std::string &problem_name=std::string("MY_MPS")) |
|
void | print_nonnegative_quadratic_program (std::ostream &out, const NonnegativeQuadraticProgram &qp, const std::string &problem_name=std::string("MY_MPS")) |
|
void | print_quadratic_program (std::ostream &out, const QuadraticProgram &qp, const std::string &problem_name=std::string("MY_MPS")) |
|
Quadratic_program_solution< ET > | solve_linear_program (const LinearProgram &lp, const ET &, const Quadratic_program_options &options=Quadratic_program_options()) |
|
Quadratic_program_solution< ET > | solve_nonnegative_linear_program (const NonnegativeLinearProgram &lp, const ET &, const Quadratic_program_options &options=Quadratic_program_options()) |
|
Quadratic_program_solution< ET > | solve_nonnegative_quadratic_program (const NonnegativeQuadraticProgram &qp, const ET &, const Quadratic_program_options &options=Quadratic_program_options()) |
|
Quadratic_program_solution< ET > | solve_quadratic_program (const QuadraticProgram &qp, const ET &, const Quadratic_program_options &options=Quadratic_program_options()) |
|
Linear_program_from_iterators< A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, C_it > | make_linear_program_from_iterators (int n, int m, const A_it &a, const B_it &b, const R_it &r, const FL_it &fl, const L_it &l, const FU_it &fu, const U_it &u, const C_it &c, std::iterator_traits< C_it >::value_type c0=std::iterator_traits< C_it >::value_type(0)) |
|
Nonnegative_linear_program_from_iterators< A_it, B_it, R_it, C_it > | make_nonnegative_linear_program_from_iterators (int n, int m, const A_it &a, const B_it &b, const R_it &r, const C_it &c, std::iterator_traits< C_it >::value_type c0=std::iterator_traits< C_it >::value_type(0)) |
|
Nonnegative_quadratic_program_from_iterators< A_it, B_it, R_it, D_it, C_it > | make_nonnegative_quadratic_program_from_iterators (int n, int m, const A_it &a, const B_it &b, const R_it &r, const D_it &d, const C_it &c, std::iterator_traits< C_it >::value_type c0=std::iterator_traits< C_it >::value_type(0)) |
|
Quadratic_program_from_iterators< A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it > | make_quadratic_program_from_iterators (int n, int m, const A_it &a, const B_it &b, const R_it &r, const FL_it &fl, const L_it &l, const FU_it &fu, const U_it &u, const D_it &d, const C_it &c, std::iterator_traits< C_it >::value_type c0=std::iterator_traits< C_it >::value_type(0)) |
|
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) |
|
Point_d< R > | center_of_sphere (ForwardIterator first, ForwardIterator last) |
|
Point_d< R > | lift_to_paraboloid (const Point_d< R > &p) |
|
OutputIterator | linear_base (ForwardIterator first, ForwardIterator last, OutputIterator result) |
|
Point_d< R > | midpoint (const Point_d< R > &p, const Point_d< R > &q) |
|
Point_d< R > | project_along_d_axis (const Point_d< R > &p) |
|
FT | squared_distance (Point_d< R > p, Point_d< R > q) |
|
bool | do_intersect (Type1< R > obj1, Type2< R > obj2) |
|
decltype(auto) | intersection (Type1< R > f1, Type2< R > f2) |
|
bool | affinely_independent (ForwardIterator first, ForwardIterator last) |
|
int | affine_rank (ForwardIterator first, ForwardIterator last) |
|
Comparison_result | compare_lexicographically (const Point_d< R > &p, const Point_d< R > &q) |
|
bool | contained_in_affine_hull (ForwardIterator first, ForwardIterator last, const Point_d< R > &p) |
|
bool | contained_in_linear_hull (ForwardIterator first, ForwardIterator last, const Vector_d< R > &v) |
|
bool | contained_in_simplex (ForwardIterator first, ForwardIterator last, const Point_d< R > &p) |
|
bool | lexicographically_smaller (const Point_d< R > &p, const Point_d< R > &q) |
|
bool | lexicographically_smaller_or_equal (const Point_d< R > &p, const Point_d< R > &q) |
|
bool | linearly_independent (ForwardIterator first, ForwardIterator last) |
|
int | linear_rank (ForwardIterator first, ForwardIterator last) |
|
Orientation | orientation (ForwardIterator first, ForwardIterator last) |
|
Bounded_side | side_of_bounded_sphere (ForwardIterator first, ForwardIterator last, const Point_d< R > &p) |
|
Oriented_side | side_of_oriented_sphere (ForwardIterator first, ForwardIterator last, const Point_d< R > &p) |
|
bool | has_in_x_range (const Circular_arc_2< CircularKernel > &ca, const Circular_arc_point_2< CircularKernel > &p) |
|
bool | has_in_x_range (const Line_arc_2< CircularKernel > &ca, const Circular_arc_point_2< CircularKernel > &p) |
|
bool | has_on (const Circle_2< CircularKernel > &c, const Circular_arc_point_2< CircularKernel > &p) |
|
OutputIterator | make_x_monotone (const Circular_arc_2< CircularKernel > &ca, OutputIterator res) |
|
OutputIterator | make_xy_monotone (const Circular_arc_2< CircularKernel > &ca, OutputIterator res) |
|
Circular_arc_point_2< CircularKernel > | x_extremal_point (const Circle_2< CircularKernel > &c, bool b) |
|
OutputIterator | x_extremal_points (const Circle_2< CircularKernel > &c, OutputIterator res) |
|
Circular_arc_point_2< CircularKernel > | y_extremal_point (const Circle_2< CircularKernel > &c, bool b) |
|
OutputIterator | y_extremal_points (const Circle_2< CircularKernel > &c, OutputIterator res) |
|
CGAL::Comparison_result | compare_y_to_right (const Circular_arc_2< CircularKernel > &ca1, const Circular_arc_2< CircularKernel > &ca2, Circular_arc_point_2< CircularKernel > &p) |
|
CGAL::Circle_type | classify (const CGAL::Circle_3< SphericalKernel > &c, const CGAL::Sphere_3< SphericalKernel > &sphere) |
|
Comparison_result | compare_theta (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q, const CGAL::Sphere_3< SphericalKernel > &sphere) |
|
Comparison_result | compare_theta (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Vector_3< SphericalKernel > &m, const CGAL::Sphere_3< SphericalKernel > &sphere) |
|
Comparison_result | compare_theta (const CGAL::Vector_3< SphericalKernel > &m, const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Sphere_3< SphericalKernel > &sphere) |
|
bool | compare_theta_z (const CGAL::Circular_arc_point_3< SphericalKernel > &p, const CGAL::Circular_arc_point_3< SphericalKernel > &q, const CGAL::Sphere_3< SphericalKernel > &sphere) |
|
bool | is_theta_monotone (const CGAL::Circular_arc_3< SphericalKernel > &a, const CGAL::Sphere_3< SphericalKernel > &sphere) |
|
CGAL::Circular_arc_point_3< SphericalKernel > | theta_extremal_point (const CGAL::Circle_3< SphericalKernel > &c, const CGAL::Sphere_3< SphericalKernel > sphere, bool b) |
|
OutputIterator | theta_extremal_points (const CGAL::Circle_3< SphericalKernel > &c, const CGAL::Sphere_3< SphericalKernel > &sphere, OutputIterator res) |
|
CGAL::Circular_arc_point_3< SphericalKernel > | x_extremal_point (const CGAL::Sphere_3< SphericalKernel > &c, bool b) |
|
CGAL::Circular_arc_point_3< SphericalKernel > | x_extremal_point (const CGAL::Circle_3< SphericalKernel > &c, bool b) |
|
OutputIterator | x_extremal_points (const CGAL::Sphere_3< SphericalKernel > &c, OutputIterator res) |
|
OutputIterator | x_extremal_points (const CGAL::Circle_3< SphericalKernel > &c, OutputIterator res) |
|
CGAL::Circular_arc_point_3< SphericalKernel > | y_extremal_point (const CGAL::Sphere_3< SphericalKernel > &c, bool b) |
|
CGAL::Circular_arc_point_3< SphericalKernel > | y_extremal_point (const CGAL::Circle_3< SphericalKernel > &c, bool b) |
|
OutputIterator | y_extremal_points (const CGAL::Sphere_3< SphericalKernel > &c, OutputIterator res) |
|
OutputIterator | y_extremal_points (const CGAL::Circle_3< SphericalKernel > &c, OutputIterator res) |
|
CGAL::Circular_arc_point_3< SphericalKernel > | z_extremal_point (const CGAL::Sphere_3< SphericalKernel > &c, bool b) |
|
CGAL::Circular_arc_point_3< SphericalKernel > | z_extremal_point (const CGAL::Circle_3< SphericalKernel > &c, bool b) |
|
OutputIterator | z_extremal_points (const CGAL::Sphere_3< SphericalKernel > &c, OutputIterator res) |
|
OutputIterator | z_extremal_points (const CGAL::Circle_3< SphericalKernel > &c, OutputIterator res) |
|
OutputIterator | ch_akl_toussaint (ForwardIterator first, ForwardIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits()) |
|
OutputIterator | ch_bykat (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
|
OutputIterator | ch_eddy (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
|
OutputIterator | ch_graham_andrew (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
|
OutputIterator | ch_graham_andrew_scan (BidirectionalIterator first, BidirectionalIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
|
OutputIterator | ch_jarvis (ForwardIterator first, ForwardIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
|
OutputIterator | ch_jarvis_march (ForwardIterator first, ForwardIterator beyond, const Traits::Point_2 &start_p, const Traits::Point_2 &stop_p, OutputIterator result, const Traits &ch_traits=Default_traits) |
|
OutputIterator | ch_melkman (InputIterator first, InputIterator last, OutputIterator result, const Traits &ch_traits=Default_traits) |
|
void | ch_e_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &e, const Traits &ch_traits=Default_traits) |
|
void | ch_n_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &n, const Traits &ch_traits=Default_traits) |
|
void | ch_ns_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &n, ForwardIterator &s, const Traits &ch_traits=Default_traits) |
|
void | ch_nswe_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &n, ForwardIterator &s, ForwardIterator &w, ForwardIterator &e, const Traits &ch_traits=Default_traits) |
|
void | ch_s_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &s, const Traits &ch_traits=Default_traits) |
|
void | ch_we_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &w, ForwardIterator &e, const Traits &ch_traits=Default_traits) |
|
void | ch_w_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &w, const Traits &ch_traits=Default_traits) |
|
OutputIterator | convex_hull_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits) |
|
OutputIterator | convex_hull_2 (InputIterator first, InputIterator beyond, OutputIterator result) |
|
OutputIterator | lower_hull_points_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
|
OutputIterator | upper_hull_points_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
|
bool | is_ccw_strongly_convex_2 (ForwardIterator first, ForwardIterator beyond, const Traits &ch_traits=Default_traits) |
|
bool | is_cw_strongly_convex_2 (ForwardIterator first, ForwardIterator beyond, const Traits &ch_traits=Default_traits) |
|
void | halfspace_intersection_3 (PlaneIterator begin, PlaneIterator end, PolygonMesh &pm, boost::optional< Kernel_traits< std::iterator_traits< PlaneIterator >::value_type >::Kernel::Point_3 > > origin=boost::none) |
|
void | halfspace_intersection_with_constructions_3 (PlaneIterator pbegin, PlaneIterator pend, PolygonMesh &pm, boost::optional< Kernel_traits< std::iterator_traits< PlaneIterator >::value_type >::Kernel::Point_3 > > origin=boost::none, const Traits &ch_traits=Default_traits) |
|
void | convex_hull_3 (InputIterator first, InputIterator last, PolygonMesh &pm, const Traits &ch_traits=Default_traits) |
|
void | convex_hull_3 (const VertexListGraph &g, PolygonMesh &pm, const NamedParameters &np=parameters::default_values()) |
|
void | convex_hull_3 (InputIterator first, InputIterator last, Object &ch_object, const Traits &ch_traits=Default_traits) |
|
void | convex_hull_3 (InputIterator first, InputIterator last, PointRange &vertices, PolygonRange &faces, const Traits &ch_traits=Default_traits) |
|
OutputIterator | extreme_points_3 (InputRange range, OutputIterator out, const Traits &traits) |
|
void | convex_hull_3_to_face_graph (const Triangulation &T, PolygonMesh &pm) |
|
bool | is_strongly_convex_3 (PolygonMesh &pm, const Traits &traits=Default_traits) |
|
Extreme_points_traits_adapter_3< PointPropertyMap, Base_traits > | make_extreme_points_traits_adapter (const PointPropertyMap &pmap, Base_traits traits) |
|
boost::optional< typename Kernel_traits< typename std::iterator_traits< PlaneIterator >::value_type >::Kernel::Point_3 > | halfspace_intersection_interior_point_3 (PlaneIterator begin, PlaneIterator end) |
|
void | complement (const Polygon_2< Kernel, Container > &pgn, Polygon_with_holes_2< Kernel, Container > &res) |
|
void | complement (const Polygon_2< Kernel, Container > &pgn, Polygon_with_holes_2< Kernel, Container > &res, UsePolylines=Tag_true()) |
|
void | complement (const General_polygon_2< ArrTraits > &pgn, General_polygon_with_holes_2< General_polygon_2< Arr_traits >> &res) |
|
OutputIterator | complement (const Polygon_with_holes_2< Kernel, Container > &pgn, OutputIterator oi) |
|
OutputIterator | complement (const Polygon_with_holes_2< Kernel, Container > &pgn, OutputIterator oi, UsePolylines=Tag_true()) |
|
OutputIterator | complement (const General_polygon_with_holes_2< General_polygon_2< ArrTraits >> &pgn, OutputIterator oi) |
|
void | complement (const Polygon_2< Kernel, Container > &pgn, Polygon_with_holes_2< Kernel, Container > &res, const GpsTraits &traits) |
|
void | complement (const General_polygon_2< ArrTraits > &pgn, General_polygon_with_holes_2< General_polygon_2< Arr_traits >> &res, const GpsTraits &traits) |
|
OutputIterator | complement (const |