dust3d/thirdparty/cgal/CGAL-5.1/include/CGAL/Polynomials_2_2.h

72 lines
1.8 KiB
C++

// Copyright (c) 2003-2006 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
//
// $URL: https://github.com/CGAL/cgal/blob/v5.1/Algebraic_kernel_for_circles/include/CGAL/Polynomials_2_2.h $
// $Id: Polynomials_2_2.h 0779373 2020-03-26T13:31:46+01:00 Sébastien Loriot
// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
//
// Author(s) : Monique Teillaud, Sylvain Pion
// 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_FOR_CIRCLES_POLYNOMIALS_2_2_H
#define CGAL_ALGEBRAIC_KERNEL_FOR_CIRCLES_POLYNOMIALS_2_2_H
#include <CGAL/license/Circular_kernel_2.h>
//////////// FIXME - pb RT (cas general Polynomial_2_2) ou FT (ici)
#include <CGAL/enum.h>
namespace CGAL {
// 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()) );
}
} //namespace CGAL
#endif //CGAL_ALGEBRAIC_KERNEL_FOR_CIRCLES_POLYNOMIALS_2_2_H