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
82
83
84
85
86
87
88
89
90
91
92
93
|
// 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/Iso_rectangle_2_Iso_rectangle_2.h $
// $Id: include/CGAL/Intersections_2/Iso_rectangle_2_Iso_rectangle_2.h 08b27d3db14 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Geert-Jan Giezeman
#ifndef CGAL_INTERSECTIONS_2_ISO_RECTANGLE_2_ISO_RECTANGLE_2_H
#define CGAL_INTERSECTIONS_2_ISO_RECTANGLE_2_ISO_RECTANGLE_2_H
#include <CGAL/Iso_rectangle_2.h>
#include <CGAL/Intersection_traits_2.h>
namespace CGAL {
namespace Intersections {
namespace internal {
template <class K>
typename CGAL::Intersection_traits
<K, typename K::Iso_rectangle_2, typename K::Iso_rectangle_2>::result_type
intersection(
const typename K::Iso_rectangle_2 &irect1,
const typename K::Iso_rectangle_2 &irect2,
const K&)
{
typedef typename K::FT FT;
Rational_traits<FT> rt;
typename K::Construct_point_2 construct_point_2;
typename K::Construct_iso_rectangle_2 construct_iso_rectangle_2;
const typename K::Point_2 &min1 = (irect1.min)();
const typename K::Point_2 &min2 = (irect2.min)();
const typename K::Point_2 &max1 = (irect1.max)();
const typename K::Point_2 &max2 = (irect2.max)();
typename K::FT minx, miny, maxx, maxy;
typename K::Point_2 newmin;
typename K::Point_2 newmax;
minx = (min1.x() >= min2.x()) ? min1.x() : min2.x();
maxx = (max1.x() <= max2.x()) ? max1.x() : max2.x();
if (maxx < minx)
return intersection_return<typename K::Intersect_2, typename K::Iso_rectangle_2, typename K::Iso_rectangle_2>();
miny = (min1.y() >= min2.y()) ? min1.y() : min2.y();
maxy = (max1.y() <= max2.y()) ? max1.y() : max2.y();
if (maxy < miny)
return intersection_return<typename K::Intersect_2, typename K::Iso_rectangle_2, typename K::Iso_rectangle_2>();
if (rt.denominator(minx) == rt.denominator(miny)) {
newmin = construct_point_2(rt.numerator(minx), rt.numerator(miny),
rt.denominator(minx));
} else {
newmin = construct_point_2(rt.numerator(minx) * rt.denominator(miny),
rt.numerator(miny) * rt.denominator(minx),
rt.denominator(minx) * rt.denominator(miny));
}
if (rt.denominator(maxx) == rt.denominator(maxy)) {
newmax = construct_point_2(rt.numerator(maxx), rt.numerator(maxy),
rt.denominator(maxx));
} else {
newmax = construct_point_2(rt.numerator(maxx) * rt.denominator(maxy),
rt.numerator(maxy) * rt.denominator(maxx),
rt.denominator(maxx) * rt.denominator(maxy));
}
return intersection_return<typename K::Intersect_2, typename K::Iso_rectangle_2, typename K::Iso_rectangle_2>(construct_iso_rectangle_2(newmin, newmax));
}
template<typename K>
typename K::Boolean
do_intersect(const typename K::Iso_rectangle_2& irect1,
const typename K::Iso_rectangle_2& irect2,
const K&)
{
return bool(intersection(irect1, irect2));
}
} // namespace internal
} // namespace Intersections
CGAL_INTERSECTION_FUNCTION_SELF(Iso_rectangle_2, 2)
CGAL_DO_INTERSECT_FUNCTION_SELF(Iso_rectangle_2, 2)
} // namespace CGAL
#endif // CGAL_INTERSECTIONS_2_ISO_RECTANGLE_2_ISO_RECTANGLE_2_H
|
