1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
// 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)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1.1/Intersections_2/include/CGAL/Intersections_2/Point_2_Point_2.h $
// $Id: include/CGAL/Intersections_2/Point_2_Point_2.h 08b27d3db14 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Geert-Jan Giezeman
#ifndef CGAL_INTERSECTIONS_2_POINT_2_POINT_2_H
#define CGAL_INTERSECTIONS_2_POINT_2_POINT_2_H
#include <CGAL/Point_2.h>
#include <CGAL/Intersection_traits_2.h>
namespace CGAL {
namespace Intersections {
namespace internal {
template <class K>
inline
typename K::Boolean
do_intersect(const typename K::Point_2& pt1,
const typename K::Point_2& pt2,
const K& k)
{
return k.equal_2_object()(pt1, pt2);
}
template <class K>
typename CGAL::Intersection_traits<K, typename K::Point_2, typename K::Point_2>::result_type
intersection(const typename K::Point_2& pt1,
const typename K::Point_2& pt2,
const K& k)
{
if (k.equal_2_object()(pt1, pt2))
return intersection_return<typename K::Intersect_2, typename K::Point_2, typename K::Point_2>(pt1);
return intersection_return<typename K::Intersect_2, typename K::Point_2, typename K::Point_2>();
}
} // namespace internal
} // namespace Intersections
CGAL_INTERSECTION_FUNCTION_SELF(Point_2, 2)
CGAL_DO_INTERSECT_FUNCTION_SELF(Point_2, 2)
} // namespace CGAL
#endif // CGAL_INTERSECTIONS_2_POINT_2_POINT_2_H
|
