// Copyright (c) 2000 // Utrecht University (The Netherlands), // ETH Zurich (Switzerland), // INRIA Sophia-Antipolis (France), // Max-Planck-Institute Saarbruecken (Germany), // 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; either version 3 of the License, // or (at your option) any later version. // // 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$ // $Id$ // // // Author(s) : Geert-Jan Giezeman #ifndef CGAL_POINT_2_SEGMENT_2_INTERSECTION_H #define CGAL_POINT_2_SEGMENT_2_INTERSECTION_H #include #include #include namespace CGAL { namespace internal { template inline bool do_intersect(const typename K::Point_2 &pt, const typename K::Segment_2 &seg, const K&) { return seg.has_on(pt); } template inline bool do_intersect(const typename K::Segment_2 &seg, const typename K::Point_2 &pt, const K&) { return seg.has_on(pt); } template inline typename CGAL::Intersection_traits ::result_type intersection(const typename K::Point_2 &pt, const typename K::Segment_2 &seg, const K& k) { if (do_intersect(pt,seg, k)) { return intersection_return(pt); } return intersection_return(); } template inline typename CGAL::Intersection_traits ::result_type intersection( const typename K::Segment_2 &seg, const typename K::Point_2 &pt, const K& k) { return internal::intersection(pt, seg, k); } } // namespace internal CGAL_INTERSECTION_FUNCTION(Point_2, Segment_2, 2) CGAL_DO_INTERSECT_FUNCTION(Point_2, Segment_2, 2) } //namespace CGAL #endif