1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133
|
// Copyright (c) 2000 Utrecht University (The Netherlands),
// ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany),
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
// (Germany), Max-Planck-Institute Saarbruecken (Germany), RISC Linz (Austria),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; version 2.1 of the License.
// See the file LICENSE.LGPL distributed with CGAL.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.2-branch/Cartesian_kernel/include/CGAL/Cartesian/Point_2.h $
// $Id: Point_2.h 29078 2006-03-06 13:08:09Z spion $
//
//
// Author(s) : Andreas Fabri, Herve Bronnimann
#ifndef CGAL_CARTESIAN_POINT_2_H
#define CGAL_CARTESIAN_POINT_2_H
#include <CGAL/Origin.h>
#include <CGAL/Bbox_2.h>
#include <CGAL/Twotuple.h>
#include <CGAL/Handle_for.h>
CGAL_BEGIN_NAMESPACE
template < class R_ >
class PointC2
{
typedef PointC2<R_> Self;
typedef typename R_::FT FT;
typedef typename R_::Vector_2 Vector_2;
typedef typename R_::Point_2 Point_2;
typedef typename R_::Aff_transformation_2 Aff_transformation_2;
typedef Twotuple<FT> Rep;
typedef typename R_::template Handle<Rep>::type Base;
Base base;
static FT one;
public:
typedef const FT* Cartesian_const_iterator;
typedef R_ R;
PointC2() {}
PointC2(const Origin &)
: base(FT(0), FT(0)) {}
PointC2(const FT &x, const FT &y)
: base(x, y) {}
PointC2(const FT &hx, const FT &hy, const FT &hw)
{
if (hw != FT(1))
base = Rep(hx/hw, hy/hw);
else
base = Rep(hx, hy);
}
const FT& x() const
{
return get(base).e0;
}
const FT& y() const
{
return get(base).e1;
}
const FT& hx() const
{
return x();
}
const FT& hy() const
{
return y();
}
const FT& hw() const
{
return one;
}
Cartesian_const_iterator cartesian_begin() const
{
return & get(base).e0;
}
Cartesian_const_iterator cartesian_end() const
{
const FT* ptr = & get(base).e1;
ptr++;
return ptr;
}
bool operator==(const PointC2 &p) const
{
if (CGAL::identical(base, p.base))
return true;
return equal_xy(*this, p);
}
bool operator!=(const PointC2 &p) const
{
return !(*this == p);
}
Point_2 transform(const Aff_transformation_2 &t) const
{
return t.transform(static_cast<const Point_2&>(*this));
}
};
template <class R >
typename R::FT PointC2<R>::one = 1;
CGAL_END_NAMESPACE
#endif // CGAL_CARTESIAN_POINT_2_H
|