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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
// Begin License:
// Copyright (C) 2006-2011 Tobias Sargeant (tobias.sargeant@gmail.com).
// All rights reserved.
//
// This file is part of the Carve CSG Library (http://carve-csg.com/)
//
// This file may be used under the terms of the GNU General Public
// License version 2.0 as published by the Free Software Foundation
// and appearing in the file LICENSE.GPL2 included in the packaging of
// this file.
//
// This file is provided "AS IS" with NO WARRANTY OF ANY KIND,
// INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE.
// End:
#pragma once
#include <carve/carve.hpp>
#include <carve/math_constants.hpp>
#include <carve/geom.hpp>
#include <carve/geom3d.hpp>
#include <sstream>
#include <algorithm>
#include <math.h>
namespace carve {
namespace geom3d {
struct hash_vector_ptr {
size_t operator()(const Vector * const &v) const {
return (size_t)v;
}
size_t operator()(const std::pair<const Vector *, const Vector *> &v) const {
size_t r = (size_t)v.first;
size_t s = (size_t)v.second;
return r ^ ((s >> 16) | (s << 16));
}
};
struct vec_adapt_ident {
const Vector &operator()(const Vector &v) const { return v; }
Vector &operator()(Vector &v) const { return v; }
};
struct vec_adapt_ptr {
const Vector &operator()(const Vector * const &v) const { return *v; }
Vector &operator()(Vector *&v) const { return *v; }
};
struct vec_adapt_pair_first {
template<typename pair_t> const Vector &operator()(const pair_t &v) const { return v.first; }
template<typename pair_t> Vector &operator()(pair_t &v) const { return v.first; }
};
struct vec_adapt_pair_second {
template<typename pair_t> const Vector &operator()(const pair_t &v) const { return v.second; }
template<typename pair_t> Vector &operator()(pair_t &v) const { return v.second; }
};
template<typename adapt_t>
struct vec_cmp_lt_x {
adapt_t adapt;
vec_cmp_lt_x(adapt_t _adapt = adapt_t()) : adapt(_adapt) {}
template<typename input_t> bool operator()(const input_t &a, const input_t &b) const { return adapt(a).x < adapt(b).x; }
};
template<typename adapt_t> vec_cmp_lt_x<adapt_t> vec_lt_x(adapt_t &adapt) { return vec_cmp_lt_x<adapt_t>(adapt); }
template<typename adapt_t>
struct vec_cmp_lt_y {
adapt_t adapt;
vec_cmp_lt_y(adapt_t _adapt = adapt_t()) : adapt(_adapt) {}
template<typename input_t> bool operator()(const input_t &a, const input_t &b) const { return adapt(a).y < adapt(b).y; }
};
template<typename adapt_t> vec_cmp_lt_y<adapt_t> vec_lt_y(adapt_t &adapt) { return vec_cmp_lt_y<adapt_t>(adapt); }
template<typename adapt_t>
struct vec_cmp_lt_z {
adapt_t adapt;
vec_cmp_lt_z(adapt_t _adapt = adapt_t()) : adapt(_adapt) {}
template<typename input_t> bool operator()(const input_t &a, const input_t &b) const { return adapt(a).z < adapt(b).z; }
};
template<typename adapt_t> vec_cmp_lt_z<adapt_t> vec_lt_z(adapt_t &adapt) { return vec_cmp_lt_z<adapt_t>(adapt); }
template<typename adapt_t>
struct vec_cmp_gt_x {
adapt_t adapt;
vec_cmp_gt_x(adapt_t _adapt = adapt_t()) : adapt(_adapt) {}
template<typename input_t> bool operator()(const input_t &a, const input_t &b) const { return adapt(a).x > adapt(b).x; }
};
template<typename adapt_t> vec_cmp_gt_x<adapt_t> vec_gt_x(adapt_t &adapt) { return vec_cmp_gt_x<adapt_t>(adapt); }
template<typename adapt_t>
struct vec_cmp_gt_y {
adapt_t adapt;
vec_cmp_gt_y(adapt_t _adapt = adapt_t()) : adapt(_adapt) {}
template<typename input_t> bool operator()(const input_t &a, const input_t &b) const { return adapt(a).y > adapt(b).y; }
};
template<typename adapt_t> vec_cmp_gt_y<adapt_t> vec_gt_y(adapt_t &adapt) { return vec_cmp_gt_y<adapt_t>(adapt); }
template<typename adapt_t>
struct vec_cmp_gt_z {
adapt_t adapt;
vec_cmp_gt_z(adapt_t _adapt = adapt_t()) : adapt(_adapt) {}
template<typename input_t> bool operator()(const input_t &a, const input_t &b) const { return adapt(a).z > adapt(b).z; }
};
template<typename adapt_t> vec_cmp_gt_z<adapt_t> vec_gt_z(adapt_t &adapt) { return vec_cmp_gt_z<adapt_t>(adapt); }
template<typename iter_t, typename adapt_t>
void sortInDirectionOfRay(const Vector &ray_dir, iter_t begin, iter_t end, adapt_t adapt) {
switch (carve::geom::largestAxis(ray_dir)) {
case 0:
if (ray_dir.x > 0) {
std::sort(begin, end, vec_lt_x(adapt));
} else {
std::sort(begin, end, vec_gt_x(adapt));
}
break;
case 1:
if (ray_dir.y > 0) {
std::sort(begin, end, vec_lt_y(adapt));
} else {
std::sort(begin, end, vec_gt_y(adapt));
}
break;
case 2:
if (ray_dir.z > 0) {
std::sort(begin, end, vec_lt_z(adapt));
} else {
std::sort(begin, end, vec_gt_z(adapt));
}
break;
}
}
}
}
|
