mirror of https://github.com/CGAL/cgal
61 lines
1.3 KiB
C++
61 lines
1.3 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_1_2_H
|
|
#define CGAL_ALGEBRAIC_KERNEL_POLYNOMIALS_1_2_H
|
|
|
|
#include <CGAL/enum.h>
|
|
|
|
CGAL_BEGIN_NAMESPACE
|
|
|
|
template < typename RT_ >
|
|
class Polynomial_1_2
|
|
{
|
|
RT_ rep[3]; // stores a, b, c for line ax+by+c=0
|
|
|
|
public:
|
|
|
|
typedef RT_ RT;
|
|
|
|
Polynomial_1_2(){}
|
|
|
|
Polynomial_1_2(const RT & a, const RT & b, const RT & c)
|
|
{
|
|
rep[0]=a;
|
|
rep[1]=b;
|
|
rep[2]=c;
|
|
}
|
|
|
|
const RT & a() const
|
|
{ return rep[0]; }
|
|
|
|
const RT & b() const
|
|
{ return rep[1]; }
|
|
|
|
const RT & c() const
|
|
{ return rep[2]; }
|
|
};
|
|
|
|
template < typename RT >
|
|
bool
|
|
operator == ( const Polynomial_1_2<RT> & p1,
|
|
const Polynomial_1_2<RT> & p2 )
|
|
{
|
|
return( (p1.a() == p2.a()) &&
|
|
(p1.b() == p2.b()) &&
|
|
(p1.c() == p2.c()) );
|
|
}
|
|
|
|
CGAL_END_NAMESPACE
|
|
|
|
#endif //CGAL_ALGEBRAIC_KERNEL_POLYNOMIALS_1_2_H
|