mirror of https://github.com/CGAL/cgal
55 lines
1.5 KiB
C++
55 lines
1.5 KiB
C++
// Copyright (c) 2005 INRIA Sophia-Antipolis (France)
|
|
// All rights reserved.
|
|
//
|
|
// Authors : Monique Teillaud <Monique.Teillaud@sophia.inria.fr>
|
|
// Sylvain Pion <Sylvain.Pion@sophia.inria.fr>
|
|
// Julien Hazebrouck
|
|
//
|
|
// Partially supported by the IST Programme of the EU as a Shared-cost
|
|
// RTD (FET Open) Project under Contract No IST-2000-26473
|
|
// (ECG - Effective Computational Geometry for Curves and Surfaces)
|
|
// and a STREP (FET Open) Project under Contract No IST-006413
|
|
// (ACS -- Algorithms for Complex Shapes)
|
|
|
|
#ifndef CGAL_CURVED_KERNEL_GLOBAL_FUNCTIONS_ON_CIRCLE_2_H
|
|
#define CGAL_CURVED_KERNEL_GLOBAL_FUNCTIONS_ON_CIRCLE_2_H
|
|
|
|
namespace CGAL {
|
|
|
|
template< class CK >
|
|
inline
|
|
typename CK::Polynomial_for_circles_2_2
|
|
get_equation(const typename CK::Circle_2 & c)
|
|
{
|
|
return CK().get_equation_object()(c);
|
|
}
|
|
|
|
template< class CK >
|
|
inline
|
|
typename CK::Circle_2
|
|
construct_circle_2(const typename CK::Polynomial_for_circles_2_2 & eq)
|
|
{
|
|
return CK().construct_circle_2_object()(eq);
|
|
}
|
|
|
|
template< class CK, class OutputIterator>
|
|
inline
|
|
OutputIterator
|
|
intersect_2( const typename CK::Circle_2 & c1,
|
|
const typename CK::Circle_2 & c2,
|
|
OutputIterator res )
|
|
{
|
|
return CK().intersect_2_object()(c1,c2,res);
|
|
}
|
|
|
|
template< class CK >
|
|
inline
|
|
bool
|
|
has_on_2(const typename CK::Circle_2 &c, const typename CK::Circular_arc_point_2 &p)
|
|
{
|
|
return CK().has_on_2_object()(c, p);
|
|
}
|
|
|
|
} // namespace CGAL
|
|
#endif // CGAL_CURVED_KERNEL_GLOBAL_FUNCTIONS_ON_CIRCLE_2_H
|