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
|
// Copyright (c) 2003 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1/Intersections_3/include/CGAL/Intersections_3/internal/Point_3_Triangle_3_intersection.h $
// $Id: include/CGAL/Intersections_3/internal/Point_3_Triangle_3_intersection.h b26b07a1242 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Mariette Yvinec
#ifndef CGAL_POINT_3_TRIANGLE_3_INTERSECTION_H
#define CGAL_POINT_3_TRIANGLE_3_INTERSECTION_H
#include <CGAL/Intersection_traits_3.h>
#include <CGAL/Intersections_3/internal/Point_3_Triangle_3_do_intersect.h>
namespace CGAL {
namespace Intersections {
namespace internal {
template <class K>
inline
typename CGAL::Intersection_traits<K, typename K::Point_3, typename K::Triangle_3>::result_type
intersection(const typename K::Point_3& pt,
const typename K::Triangle_3& tr,
const K& k)
{
if(do_intersect(pt, tr, k))
return intersection_return<typename K::Intersect_3, typename K::Point_3, typename K::Triangle_3>(pt);
return intersection_return<typename K::Intersect_3, typename K::Point_3, typename K::Triangle_3>();
}
template <class K>
inline
typename CGAL::Intersection_traits<K, typename K::Triangle_3, typename K::Point_3>::result_type
intersection( const typename K::Triangle_3& tr,
const typename K::Point_3& pt,
const K& k)
{
return internal::intersection(pt, tr, k);
}
} // namespace internal
} // namespace Intersections
} // namespace CGAL
#endif // CGAL_POINT_3_TRIANGLE_3_INTERSECTION_H
|
