mirror of https://github.com/CGAL/cgal
80 lines
1.8 KiB
C++
80 lines
1.8 KiB
C++
// 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_POINT_2_INTERSECTION_H
|
|
#define CGAL_POINT_2_POINT_2_INTERSECTION_H
|
|
|
|
#include <CGAL/Point_2.h>
|
|
#include <CGAL/Object.h>
|
|
|
|
namespace CGAL {
|
|
|
|
namespace internal {
|
|
|
|
template <class K>
|
|
inline bool
|
|
do_intersect(const typename K::Point_2 &pt1,
|
|
const typename K::Point_2 &pt2)
|
|
{
|
|
return pt1 == pt2;
|
|
}
|
|
|
|
template <class K>
|
|
Object
|
|
intersection(const typename K::Point_2 &pt1,
|
|
const typename K::Point_2 &pt2)
|
|
{
|
|
if (pt1 == pt2) {
|
|
return make_object(pt1);
|
|
}
|
|
return Object();
|
|
}
|
|
|
|
}// namespace internal
|
|
|
|
|
|
template <class K>
|
|
inline
|
|
bool
|
|
do_intersect(const Point_2<K> &pt1, const Point_2<K> &pt2)
|
|
{
|
|
typedef typename K::Do_intersect_2 Do_intersect;
|
|
return Do_intersect()(pt1, pt2);
|
|
}
|
|
|
|
|
|
template <class K>
|
|
inline
|
|
Object
|
|
intersection(const Point_2<K> &pt1, const Point_2<K> &pt2)
|
|
{
|
|
typedef typename K::Intersect_2 Intersect;
|
|
return Intersect()(pt1, pt2);
|
|
}
|
|
|
|
} //namespace CGAL
|
|
|
|
#endif
|