BWAPI: SPAR/AIModule/BWTA/vendors/CGAL/CGAL/Point_2_Ray_2

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/Intersections_2/include/CGAL/Point_2_Ray_2_intersection.h $
00019 // $Id: Point_2_Ray_2_intersection.h 39776 2007-08-08 15:15:20Z spion $
00020 // 
00021 //
00022 // Author(s)     : Geert-Jan Giezeman
00023 
00024 
00025 #ifndef CGAL_POINT_2_RAY_2_INTERSECTION_H
00026 #define CGAL_POINT_2_RAY_2_INTERSECTION_H
00027 
00028 #include <CGAL/Ray_2.h>
00029 #include <CGAL/Point_2.h>
00030 #include <CGAL/Object.h>
00031 
00032 CGAL_BEGIN_NAMESPACE
00033 
00034 namespace CGALi {
00035 
00036 template <class K>
00037 inline 
00038 bool
00039 do_intersect(const typename K::Point_2 &pt, 
00040              const typename K::Ray_2 &ray,
00041              const K&)
00042 {
00043   return ray.has_on(pt);
00044 }
00045 
00046 
00047 template <class K>
00048 inline 
00049 bool
00050 do_intersect(const typename K::Ray_2 &ray,
00051              const typename K::Point_2 &pt, 
00052              const K&)
00053 {
00054   return ray.has_on(pt);
00055 }
00056 
00057 
00058 template <class K>
00059 Object
00060 intersection(const typename K::Point_2 &pt, 
00061              const typename K::Ray_2 &ray,
00062              const K& k)
00063 {
00064   if (do_intersect(pt,ray, k)) {
00065     return make_object(pt);
00066   }
00067   return Object();
00068 }
00069 
00070 template <class K>
00071 Object
00072 intersection(const typename K::Ray_2 &ray,
00073              const typename K::Point_2 &pt, 
00074              const K& k)
00075 {
00076   if (do_intersect(pt,ray, k)) {
00077     return make_object(pt);
00078   }
00079   return Object();
00080 }
00081 
00082 } // namespace CGALi
00083 
00084 
00085 template <class K>
00086 inline
00087 bool
00088 do_intersect(const Ray_2<K> &ray, const Point_2<K> &pt)
00089 {
00090   typedef typename K::Do_intersect_2 Do_intersect;
00091   return Do_intersect()(pt, ray);
00092 }
00093 
00094 template <class K>
00095 inline
00096 bool
00097 do_intersect(const Point_2<K> &pt, const Ray_2<K> &ray)
00098 {
00099   typedef typename K::Do_intersect_2 Do_intersect;
00100   return Do_intersect()(pt, ray);
00101 }
00102 
00103 
00104 template <class K>
00105 inline Object
00106 intersection(const Ray_2<K> &ray, const Point_2<K> &pt)
00107 {
00108   typedef typename K::Intersect_2 Intersect;
00109   return Intersect()(pt, ray);
00110 }
00111 
00112 template <class K>
00113 inline Object
00114 intersection(const Point_2<K> &pt, const Ray_2<K> &ray)
00115 {
00116   typedef typename K::Intersect_2 Intersect;
00117   return Intersect()(pt, ray);
00118 }
00119 
00120 CGAL_END_NAMESPACE
00121 
00122 #endif