// 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. // // $Source$ // $Revision$ $Date$ // $Name$ // // Author(s) : Andreas Fabri, Herve Bronnimann #ifndef CGAL_CARTESIAN_POINT_2_H #define CGAL_CARTESIAN_POINT_2_H #include #include #include #include CGAL_BEGIN_NAMESPACE template < class R_ > class PointC2 { 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 Rep; typedef typename R_::template Handle::type Base; Base base; public: typedef Cartesian_coordinate_iterator_2 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(); } FT hw() const { return FT(1); } const FT& cartesian(int i) const; FT homogeneous(int i) const; const FT& operator[](int i) const { return cartesian(i); } Cartesian_const_iterator cartesian_begin() const { return Cartesian_const_iterator(static_cast(this),0); } Cartesian_const_iterator cartesian_end() const { return Cartesian_const_iterator(static_cast(this), 2); } int dimension() const { return 2; } 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); } Bbox_2 bbox() const; Point_2 transform(const Aff_transformation_2 &t) const { return t.transform(static_cast(*this)); } }; template < class R > CGAL_KERNEL_INLINE const typename PointC2::FT & PointC2::cartesian(int i) const { CGAL_kernel_precondition( (i == 0) || (i == 1) ); return *(&(get(base).e0)+i); } template < class R > CGAL_KERNEL_INLINE typename PointC2::FT PointC2::homogeneous(int i) const { CGAL_kernel_precondition( (i>=0) && (i<=2) ); if (i<2) return cartesian(i); return FT(1); } template < class R > CGAL_KERNEL_INLINE Bbox_2 PointC2::bbox() const { std::pair xp = CGAL::to_interval(x()); std::pair yp = CGAL::to_interval(y()); return Bbox_2(xp.first, yp.first, xp.second, yp.second); } #ifndef CGAL_NO_OSTREAM_INSERT_POINTC2 template < class R > std::ostream & operator<<(std::ostream &os, const PointC2 &p) { switch(os.iword(IO::mode)) { case IO::ASCII : return os << p.x() << ' ' << p.y(); case IO::BINARY : write(os, p.x()); write(os, p.y()); return os; default: return os << "PointC2(" << p.x() << ", " << p.y() << ')'; } } #endif // CGAL_NO_OSTREAM_INSERT_POINTC2 #ifndef CGAL_NO_ISTREAM_EXTRACT_POINTC2 template < class R > std::istream & operator>>(std::istream &is, PointC2 &p) { typename R::FT x, y; switch(is.iword(IO::mode)) { case IO::ASCII : is >> x >> y; break; case IO::BINARY : read(is, x); read(is, y); break; default: std::cerr << "" << std::endl; std::cerr << "Stream must be in ascii or binary mode" << std::endl; break; } if (is) p = PointC2(x, y); return is; } #endif // CGAL_NO_ISTREAM_EXTRACT_POINTC2 CGAL_END_NAMESPACE #endif // CGAL_CARTESIAN_POINT_2_H