mirror of https://github.com/CGAL/cgal
122 lines
2.7 KiB
C++
122 lines
2.7 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/Object.h>
|
|
|
|
CGAL_BEGIN_NAMESPACE
|
|
|
|
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
|
|
Object
|
|
intersection(const typename K::Point_2 &pt,
|
|
const typename K::Segment_2 &seg,
|
|
const K&)
|
|
{
|
|
if (do_intersect(pt,seg)) {
|
|
return make_object(pt);
|
|
}
|
|
return Object();
|
|
}
|
|
|
|
template <class K>
|
|
inline
|
|
Object
|
|
intersection( const typename K::Segment_2 &seg,
|
|
const typename K::Point_2 &pt,
|
|
const K&)
|
|
{
|
|
if (do_intersect(pt,seg)) {
|
|
return make_object(pt);
|
|
}
|
|
return Object();
|
|
}
|
|
|
|
} // namespace internal
|
|
|
|
|
|
template <class K>
|
|
inline bool
|
|
do_intersect(const Segment_2<K> &seg, const Point_2<K> &pt)
|
|
{
|
|
typedef typename K::Do_intersect_2 Do_intersect;
|
|
return Do_intersect()(pt, seg);
|
|
}
|
|
|
|
template <class K>
|
|
inline bool
|
|
do_intersect(const Point_2<K> &pt, const Segment_2<K> &seg)
|
|
{
|
|
typedef typename K::Do_intersect_2 Do_intersect;
|
|
return Do_intersect()(pt, seg);
|
|
}
|
|
|
|
|
|
template <class K>
|
|
inline Object
|
|
intersection(const Segment_2<K> &seg, const Point_2<K> &pt)
|
|
{
|
|
typedef typename K::Intersect_2 Intersect;
|
|
return Intersect()(pt, seg);
|
|
}
|
|
|
|
template <class K>
|
|
inline Object
|
|
intersection(const Point_2<K> &pt, const Segment_2<K> &seg)
|
|
{
|
|
typedef typename K::Intersect_2 Intersect;
|
|
return Intersect()(pt, seg);
|
|
}
|
|
|
|
CGAL_END_NAMESPACE
|
|
|
|
#endif
|