File: Ray_3_Ray_3_intersection.h

package info (click to toggle)
cgal 6.1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 144,912 kB
  • sloc: cpp: 810,858; ansic: 208,477; sh: 493; python: 411; makefile: 286; javascript: 174
file content (81 lines) | stat: -rw-r--r-- 2,632 bytes parent folder | download
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
// 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/Ray_3_Ray_3_intersection.h $
// $Id: include/CGAL/Intersections_3/internal/Ray_3_Ray_3_intersection.h b26b07a1242 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s)     : Sébastien Loriot

#ifndef CGAL_RAY_3_RAY_3_INTERSECTION_H
#define CGAL_RAY_3_RAY_3_INTERSECTION_H

#include <CGAL/Intersections_3/internal/Line_3_Ray_3_intersection.h>

#include <CGAL/enum.h>

namespace CGAL {
namespace Intersections {
namespace internal {

template <class K>
typename Intersection_traits<K, typename K::Ray_3, typename K::Ray_3>::result_type
intersection(const typename K::Ray_3& r1,
             const typename K::Ray_3& r2,
             const K& k)
{
  CGAL_precondition(!r1.is_degenerate() && !r2.is_degenerate());

  typename Intersection_traits<K, typename K::Line_3, typename K::Ray_3>::result_type
      v = internal::intersection(r1.supporting_line(), r2, k);

  if(v)
  {
    if(const typename K::Point_3* p = intersect_get<typename K::Point_3>(v))
    {
      if(Ray_3_has_on_collinear_Point_3(r1,*p,k))
        return intersection_return<typename K::Intersect_3, typename K::Ray_3, typename K::Ray_3>(*p);
    }
    else if(const typename K::Ray_3* r = intersect_get<typename K::Ray_3>(v))
    {
      bool r1_has_s2 = Ray_3_has_on_collinear_Point_3(r1,r2.source(),k);
      bool r2_has_s1 = Ray_3_has_on_collinear_Point_3(r2,r1.source(),k);

      if(r1_has_s2)
      {
        if(r2_has_s1)
        {
          if(k.equal_3_object()(r1.source(),r2.source()))
          {
            return intersection_return<typename K::Intersect_3, typename K::Ray_3, typename K::Ray_3>(r1.source());
          }
          else
          {
            return intersection_return<typename K::Intersect_3, typename K::Ray_3, typename K::Ray_3>(
                     k.construct_segment_3_object()(r1.source(), r2.source()));
          }
        }
        else
        {
          return intersection_return<typename K::Intersect_3, typename K::Ray_3, typename K::Ray_3>(*r);
        }
      }
      else
      {
        if(r2_has_s1)
          return intersection_return<typename K::Intersect_3, typename K::Ray_3, typename K::Ray_3>(r1);
      }
    }
  }

  return intersection_return<typename K::Intersect_3, typename K::Ray_3, typename K::Ray_3>();
}

} // namespace internal
} // namespace Intersections
} // namespace CGAL

#endif // CGAL_RAY_3_RAY_3_INTERSECTION_H