BWAPI: SPAR/AIModule/BWTA/vendors/CGAL/CGAL/Cartesian/Triangle

Go to the documentation of this file.
00001 // Copyright (c) 2000  Utrecht University (The Netherlands),
00002 // ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany),
00003 // INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
00004 // (Germany), Max-Planck-Institute Saarbruecken (Germany), RISC Linz (Austria),
00005 // and Tel-Aviv University (Israel).  All rights reserved.
00006 //
00007 // This file is part of CGAL (www.cgal.org); you can redistribute it and/or
00008 // modify it under the terms of the GNU Lesser General Public License as
00009 // published by the Free Software Foundation; version 2.1 of the License.
00010 // See the file LICENSE.LGPL distributed with CGAL.
00011 //
00012 // Licensees holding a valid commercial license may use this file in
00013 // accordance with the commercial license agreement provided with the software.
00014 //
00015 // This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
00016 // WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
00017 //
00018 // $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.5-branch/Cartesian_kernel/include/CGAL/Cartesian/Triangle_2.h $
00019 // $Id: Triangle_2.h 49057 2009-04-30 14:03:52Z spion $
00020 // 
00021 //
00022 // Author(s)     : Andreas Fabri, Herve Bronnimann
00023 
00024 #ifndef CGAL_CARTESIAN_TRIANGLE_2_H
00025 #define CGAL_CARTESIAN_TRIANGLE_2_H
00026 
00027 #include <CGAL/Cartesian/predicates_on_points_2.h>
00028 #include <CGAL/array.h>
00029 
00030 CGAL_BEGIN_NAMESPACE
00031 
00032 template <class R_>
00033 class TriangleC2
00034 {
00035   typedef typename R_::FT                   FT;
00036   typedef typename R_::Point_2              Point_2;
00037   typedef typename R_::Vector_2             Vector_2;
00038   typedef typename R_::Triangle_2           Triangle_2;
00039 
00040   typedef cpp0x::array<Point_2, 3>          Rep;
00041   typedef typename R_::template Handle<Rep>::type  Base;
00042 
00043   Base base;
00044 
00045 public:
00046   typedef R_                                    R;
00047 
00048   TriangleC2() {}
00049 
00050   TriangleC2(const Point_2 &p, const Point_2 &q, const Point_2 &r)
00051     : base(CGAL::make_array(p, q, r)) {}
00052 
00053 
00054   const Point_2 &
00055   vertex(int i) const
00056   {
00057     if (i>2) i = i%3;
00058     else if (i<0) i = (i%3) + 3;
00059     return (i==0) ? get(base)[0] :
00060       (i==1) ? get(base)[1] :
00061       get(base)[2];
00062   }
00063   
00064   const Point_2 &
00065   operator[](int i) const
00066   {
00067     return vertex(i);
00068   }
00069 
00070 };
00071 
00072 CGAL_END_NAMESPACE
00073 
00074 #endif // CGAL_CARTESIAN_TRIANGLE_2_H