blob: 3bd3555cacbb51983983702753960b8d6790bef7 (
plain)
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
/* SPDX-License-Identifier: GPL-2.0-or-later */
#pragma once
/** \file
* \ingroup freestyle
* \brief A class to hold a bounding box
*/
#include <algorithm>
#include <stdlib.h>
#include "BLI_utildefines.h"
#ifdef WITH_CXX_GUARDEDALLOC
# include "MEM_guardedalloc.h"
#endif
namespace Freestyle {
template<class Point> class BBox {
public:
inline BBox()
{
_empty = true;
}
template<class T> inline BBox(const T &min_in, const T &max_in) : _min(min_in), _max(max_in)
{
_empty = false;
}
template<class T> inline BBox(const BBox<T> &b) : _min(b.getMin()), _max(b.getMax())
{
_empty = false;
}
template<class T> inline void extendToContain(const T &p)
{
if (_empty) {
_min = p;
_max = p;
_empty = false;
return;
}
for (unsigned int i = 0; i < Point::dim(); i++) {
if (p[i] < _min[i]) {
_min[i] = p[i];
}
else if (p[i] > _max[i]) {
_max[i] = p[i];
}
}
_empty = false;
}
inline void clear()
{
_empty = true;
}
inline bool empty() const
{
return _empty;
}
inline const Point &getMin() const
{
return _min;
}
inline const Point &getMax() const
{
return _max;
}
inline BBox<Point> &operator=(const BBox<Point> &b)
{
BLI_assert(!b.empty());
_min = b.getMin();
_max = b.getMax();
_empty = false;
return *this;
}
inline BBox<Point> &operator+=(const BBox<Point> &b)
{
BLI_assert(!b.empty());
if (_empty) {
_min = b.getMin();
_max = b.getMax();
_empty = false;
}
else {
for (unsigned int i = 0; i < Point::dim(); i++) {
if (b.getMin()[i] < _min[i]) {
_min[i] = b.getMin()[i];
}
if (b.getMax()[i] > _max[i]) {
_max[i] = b.getMax()[i];
}
}
}
return *this;
}
inline bool inside(const Point &p)
{
if (empty()) {
return false;
}
for (unsigned int i = 0; i < Point::dim(); i++) {
if ((_min[i] > p[i]) || (_max[i] < p[i])) {
return false;
}
}
return true;
}
private:
Point _min;
Point _max;
bool _empty;
#ifdef WITH_CXX_GUARDEDALLOC
MEM_CXX_CLASS_ALLOC_FUNCS("Freestyle:BBox")
#endif
};
template<class Point> BBox<Point> &operator+(const BBox<Point> &b1, const BBox<Point> &b2)
{
Point new_min;
Point new_max;
for (unsigned int i = 0; i < Point::dim(); i++) {
new_min[i] = b1.getMin()[i] < b2.getMin()[i] ? b1.getMin()[i] : b2.getMin()[i];
new_max[i] = b1.getMax()[i] > b2.getMax()[i] ? b1.getMax()[i] : b2.getMax()[i];
}
return BBox<Point>(new_min, new_max);
}
} /* namespace Freestyle */
|
