mirror of https://github.com/CGAL/cgal
87 lines
2.3 KiB
C++
87 lines
2.3 KiB
C++
// 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.
|
|
//
|
|
// $URL$
|
|
// $Id$
|
|
//
|
|
//
|
|
// Author(s) : Geert-Jan Giezeman
|
|
|
|
|
|
#ifndef CGAL_POINT_2_SEGMENT_2_INTERSECTION_H
|
|
#define CGAL_POINT_2_SEGMENT_2_INTERSECTION_H
|
|
|
|
#include <CGAL/Segment_2.h>
|
|
#include <CGAL/Point_2.h>
|
|
#include <CGAL/Intersection_traits_2.h>
|
|
|
|
namespace CGAL {
|
|
|
|
namespace internal {
|
|
|
|
template <class K>
|
|
inline
|
|
bool
|
|
do_intersect(const typename K::Point_2 &pt,
|
|
const typename K::Segment_2 &seg,
|
|
const K&)
|
|
{
|
|
return seg.has_on(pt);
|
|
}
|
|
|
|
template <class K>
|
|
inline
|
|
bool
|
|
do_intersect(const typename K::Segment_2 &seg,
|
|
const typename K::Point_2 &pt,
|
|
const K&)
|
|
{
|
|
return seg.has_on(pt);
|
|
}
|
|
|
|
|
|
template <class K>
|
|
inline
|
|
typename CGAL::Intersection_traits
|
|
<K, typename K::Point_2, typename K::Segment_2>::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<K, typename K::Point_2, typename K::Segment_2>(pt);
|
|
}
|
|
return intersection_return<K, typename K::Point_2, typename K::Segment_2>();
|
|
}
|
|
|
|
template <class K>
|
|
inline
|
|
typename CGAL::Intersection_traits
|
|
<K, typename K::Segment_2, typename K::Point_2>::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
|
|
|
|
} //namespace CGAL
|
|
|
|
#endif
|