|
BWAPI
|

Go to the source code of this file.
Namespaces | |
| namespace | CircularFunctors |
Functions | |
| template<class CK > | |
| CGAL_BEGIN_NAMESPACE CK::Circular_arc_point_2 | circle_intersect (const typename CK::Circle_2 &c1, const typename CK::Circle_2 &c2, bool b) |
| template<class CK > | |
| CK::Polynomial_for_circles_2_2 | CircularFunctors::get_equation (const typename CK::Circle_2 &c) |
| template<class CK > | |
| CK::Circle_2 | CircularFunctors::construct_circle_2 (const typename CK::Polynomial_for_circles_2_2 &eq) |
| template<class CK > | |
| bool | CircularFunctors::has_on (const typename CK::Circle_2 &a, const typename CK::Circular_arc_point_2 &p) |
| template<class CK > | |
| bool | CircularFunctors::non_oriented_equal (const typename CK::Circle_2 &c1, const typename CK::Circle_2 &c2) |
| template<class CK > | |
| CK::Linear_kernel::Bounded_side | CircularFunctors::bounded_side (const typename CK::Circle_2 &c, const typename CK::Circular_arc_point_2 &p) |
| template<class CK , class OutputIterator > | |
| OutputIterator | CircularFunctors::intersect_2 (const typename CK::Circle_2 &c1, const typename CK::Circle_2 &c2, OutputIterator res) |
| template<class CK > | |
| CK::Circular_arc_point_2 | CircularFunctors::x_extremal_point (const typename CK::Circle_2 &c, bool i) |
| template<class CK , class OutputIterator > | |
| OutputIterator | CircularFunctors::x_extremal_points (const typename CK::Circle_2 &c, OutputIterator res) |
| template<class CK > | |
| CK::Circular_arc_point_2 | CircularFunctors::y_extremal_point (const typename CK::Circle_2 &c, bool i) |
| template<class CK , class OutputIterator > | |
| OutputIterator | CircularFunctors::y_extremal_points (const typename CK::Circle_2 &c, OutputIterator res) |
| CGAL_BEGIN_NAMESPACE CK::Circular_arc_point_2 circle_intersect | ( | const typename CK::Circle_2 & | c1, |
| const typename CK::Circle_2 & | c2, | ||
| bool | b | ||
| ) |

1.7.6.1