BWAPI: SPAR/AIModule/BWTA/vendors/CGAL/CGAL/Point_2_Segment_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_Segment_2_intersection.h $
00019 // $Id: Point_2_Segment_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_SEGMENT_2_INTERSECTION_H
00026 #define CGAL_POINT_2_SEGMENT_2_INTERSECTION_H
00027 
00028 #include <CGAL/Segment_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::Segment_2 &seg,
00041              const K&)
00042 {
00043     return seg.has_on(pt);
00044 }
00045 
00046 template <class K>
00047 inline 
00048 bool
00049 do_intersect(const typename K::Segment_2 &seg,
00050              const typename K::Point_2 &pt, 
00051              const K&)
00052 {
00053     return seg.has_on(pt);
00054 }
00055 
00056 
00057 template <class K>
00058 inline
00059 Object
00060 intersection(const typename K::Point_2 &pt, 
00061              const typename K::Segment_2 &seg, 
00062              const K&)
00063 {
00064     if (do_intersect(pt,seg)) {
00065         return make_object(pt);
00066     }
00067     return Object();
00068 }
00069 
00070 template <class K>
00071 inline
00072 Object
00073 intersection( const typename K::Segment_2 &seg, 
00074               const typename K::Point_2 &pt, 
00075               const K&)
00076 {
00077     if (do_intersect(pt,seg)) {
00078         return make_object(pt);
00079     }
00080     return Object();
00081 }
00082 
00083 } // namespace CGALi
00084 
00085 
00086 template <class K>
00087 inline bool
00088 do_intersect(const Segment_2<K> &seg, const Point_2<K> &pt)
00089 {
00090   typedef typename K::Do_intersect_2 Do_intersect;
00091   return Do_intersect()(pt, seg);
00092 }
00093 
00094 template <class K>
00095 inline bool
00096 do_intersect(const Point_2<K> &pt, const Segment_2<K> &seg)
00097 {
00098   typedef typename K::Do_intersect_2 Do_intersect;
00099     return Do_intersect()(pt, seg);
00100 }
00101 
00102 
00103 template <class K>
00104 inline Object
00105 intersection(const Segment_2<K> &seg, const Point_2<K> &pt)
00106 {
00107   typedef typename K::Intersect_2 Intersect;
00108   return Intersect()(pt, seg);
00109 }
00110 
00111 template <class K>
00112 inline Object
00113 intersection(const Point_2<K> &pt, const Segment_2<K> &seg)
00114 {
00115   typedef typename K::Intersect_2 Intersect;
00116     return Intersect()(pt, seg);
00117 }
00118 
00119 CGAL_END_NAMESPACE
00120 
00121 #endif