cgal/Algebraic_kernel/include/CGAL/Polynomials_2_2.h

64 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>
//
// 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_ALGEBRAIC_KERNEL_POLYNOMIALS_2_2_H
#define CGAL_ALGEBRAIC_KERNEL_POLYNOMIALS_2_2_H
//////////// FIXME - pb RT (cas general Polynomial_2_2) ou FT (ici)
#include <CGAL/enum.h>
CGAL_BEGIN_NAMESPACE
// polynomials of the form (X-a)^2 + (Y-b)^2 - R^2
template < typename FT_ >
class Polynomial_for_circles_2_2
{
FT_ rep[3]; // stores a, b, R^2
public:
typedef FT_ FT;
Polynomial_for_circles_2_2(){}
Polynomial_for_circles_2_2(const FT & a, const FT & b, const FT & rsq)
{
rep[0]=a;
rep[1]=b;
rep[2]=rsq;
}
const FT & a() const
{ return rep[0]; }
const FT & b() const
{ return rep[1]; }
const FT & r_sq() const
{ return rep[2]; }
};
template < typename FT >
bool
operator == ( const Polynomial_for_circles_2_2<FT> & p1,
const Polynomial_for_circles_2_2<FT> & p2 )
{
return( (p1.a() == p2.a()) &&
(p1.b() == p2.b()) &&
(p1.r_sq() == p2.r_sq()) );
}
CGAL_END_NAMESPACE
#endif //CGAL_ALGEBRAIC_KERNEL_POLYNOMIALS_2_2_H