GCC Code Coverage Report

Directory: ./
File: mesh/triangle_intersection.cpp
Date: 2026-11-07 04:23:50
Exec Total Coverage
Lines: 408 448 91.1%
Functions: 22 26 84.6%
Branches: 353 689 51.2%
Line Branch Exec Source
1 /*
2 * Copyright (c) 2000-2022 Inria
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are met:
7 *
8 * * Redistributions of source code must retain the above copyright notice,
9 * this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above copyright notice,
11 * this list of conditions and the following disclaimer in the documentation
12 * and/or other materials provided with the distribution.
13 * * Neither the name of the ALICE Project-Team nor the names of its
14 * contributors may be used to endorse or promote products derived from this
15 * software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
21 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27 * POSSIBILITY OF SUCH DAMAGE.
28 *
29 * Contact: Bruno Levy
30 *
31 * https://www.inria.fr/fr/bruno-levy
32 *
33 * Inria,
34 * Domaine de Voluceau,
35 * 78150 Le Chesnay - Rocquencourt
36 * FRANCE
37 *
38 */
39
40 #include <geogram/mesh/triangle_intersection.h>
41 #include <geogram/numerics/predicates.h>
42 #include <geogram/numerics/exact_geometry.h>
43 #include <geogram/basic/string.h>
44 #include <geogram/basic/geometry.h>
45 #include <geogram/basic/argused.h>
46 #include <geogram/basic/logger.h>
47 #include <geogram/basic/algorithm.h>
48
49
50 #ifdef GEO_COMPILER_CLANG
51 #pragma GCC diagnostic ignored "-Wswitch-enum"
52 #endif
53
54 // Uncomment to activate debug messages
55 //#define TT_DEBUG
56
57 namespace {
58
59 using namespace GEO;
60
61 /**
62 * \brief Internal implementation class for
63 * triangles_intersections()
64 * \details Keeps the coordinates of the 2x3
65 * vertices of the triangles and a reference
66 * to the result symbolic information
67 */
68 class TriangleTriangleIntersection {
69 public:
70
71 static constexpr int CACHE_UNINITIALIZED = -2;
72
73 ✗ TriangleTriangleIntersection(
74 const vec3& p0, const vec3& p1, const vec3& p2,
75 const vec3& q0, const vec3& q1, const vec3& q2,
76 TriangleIsects* result = nullptr
77 ✗ ) : result_(result) {
78 ✗ p_[0] = p0;
79 ✗ p_[1] = p1;
80 ✗ p_[2] = p2;
81 ✗ p_[3] = q0;
82 ✗ p_[4] = q1;
83 ✗ p_[5] = q2;
84 ✗ for(index_t i=0; i<64; ++i) {
85 ✗ o3d_cache_[i] = CACHE_UNINITIALIZED;
86 }
87 ✗ has_non_degenerate_intersection_ = false;
88 ✗ for(index_t i=0; i<6; ++i) {
89 ✗ p_index_[i] = NO_INDEX;
90 }
91 ✗ has_global_indices_ = false;
92 ✗ }
93
94 981370 TriangleTriangleIntersection(
95 const vec3& p0, const vec3& p1, const vec3& p2,
96 const vec3& q0, const vec3& q1, const vec3& q2,
97 index_t p0_index,
98 index_t p1_index,
99 index_t p2_index,
100 index_t q0_index,
101 index_t q1_index,
102 index_t q2_index,
103 TriangleIsects* result = nullptr
104
2/2
✓ Branch 1 taken 5888220 times.
✓ Branch 2 taken 981370 times.
 6869590 ) : result_(result) {
105 981370 p_[0] = p0;
106 981370 p_[1] = p1;
107 981370 p_[2] = p2;
108 981370 p_[3] = q0;
109 981370 p_[4] = q1;
110 981370 p_[5] = q2;
111
2/2
✓ Branch 0 taken 62807680 times.
✓ Branch 1 taken 981370 times.
 63789050 for(index_t i=0; i<64; ++i) {
112 62807680 o3d_cache_[i] = CACHE_UNINITIALIZED;
113 }
114 981370 has_non_degenerate_intersection_ = false;
115 981370 p_index_[0] = p0_index;
116 981370 p_index_[1] = p1_index;
117 981370 p_index_[2] = p2_index;
118 981370 p_index_[3] = q0_index;
119 981370 p_index_[4] = q1_index;
120 981370 p_index_[5] = q2_index;
121 981370 has_global_indices_ = true;
122 981370 }
123
124 981370 void compute() {
125 #ifdef TT_DEBUG
126 Logger::out("TT") << "Call compute()" << std::endl;
127 #endif
128
129
1/2
✓ Branch 0 taken 981370 times.
✗ Branch 1 not taken.
 981370 if(result_ != nullptr) {
130 981370 result_->resize(0);
131 }
132
133 // Test for degenerate triangles
134 981370 if(
135
2/4
✓ Branch 1 taken 981370 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 981370 times.
 1962740 triangle_dim(T1_RGN_P0, T1_RGN_P1, T1_RGN_P2) != 2 ||
136
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 981370 times.
 981370 triangle_dim(T2_RGN_P0, T2_RGN_P1, T2_RGN_P2) != 2
137 ) {
138 /*
139 Logger::warn("PCK")
140 << "Tri tri intersect: degenerate triangle "
141 << "(not supported)"
142 << std::endl;
143 */
144 ✗ return;
145 }
146
147
1/2
✓ Branch 0 taken 981370 times.
✗ Branch 1 not taken.
 981370 if(has_global_indices_) {
148
149 981370 index_t q_index[3] = {
150 NO_INDEX, NO_INDEX, NO_INDEX
151 };
152
153
2/2
✓ Branch 0 taken 2944110 times.
✓ Branch 1 taken 981370 times.
 3925480 for(index_t i=0; i<3; ++i) {
154
2/2
✓ Branch 0 taken 8832330 times.
✓ Branch 1 taken 2944110 times.
 11776440 for(index_t j=0; j<3; ++j) {
155
2/2
✓ Branch 0 taken 881112 times.
✓ Branch 1 taken 7951218 times.
 8832330 if(p_index_[i+3] == p_index_[j]) {
156 881112 q_index[i] = j;
157 }
158 }
159 }
160
161 // Early exit tests for configurations where 1 or 2 vertices
162 // are shared.
163 981370 int nb_shared = (
164 981370 (q_index[0] != NO_INDEX) +
165 981370 (q_index[1] != NO_INDEX) +
166 981370 (q_index[2] != NO_INDEX) ) ;
167
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 981370 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 981370 geo_debug_assert(nb_shared != 3);
168
169 // If there is a single shared vertex, early exit if non-shared
170 // edge [q1,q2] is strictly on one side of [p1,p2,p3]
171
2/2
✓ Branch 0 taken 537076 times.
✓ Branch 1 taken 444294 times.
 981370 if(nb_shared == 1) {
172 537076 int shared_q =
173
2/2
✓ Branch 0 taken 177182 times.
✓ Branch 1 taken 359894 times.
 537076 (q_index[1] != NO_INDEX) + (q_index[2] != NO_INDEX)*2;
174
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 537076 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 537076 geo_debug_assert(q_index[shared_q] != NO_INDEX);
175 537076 TriangleRegion q1 =
176 537076 TriangleRegion(T2_RGN_P0 + ((shared_q+1))%3);
177 537076 TriangleRegion q2 =
178 537076 TriangleRegion(T2_RGN_P0 + ((shared_q+2))%3);
179 TriangleRegion p1,p2,p3;
180
1/2
✓ Branch 1 taken 537076 times.
✗ Branch 2 not taken.
 537076 get_triangle_vertices(T1_RGN_T, p1,p2,p3);
181
1/2
✓ Branch 1 taken 537076 times.
✗ Branch 2 not taken.
 537076 Sign o1 = orient3d(p1,p2,p3,q1);
182
1/2
✓ Branch 1 taken 537076 times.
✗ Branch 2 not taken.
 537076 Sign o2 = orient3d(p1,p2,p3,q2);
183
2/2
✓ Branch 0 taken 447891 times.
✓ Branch 1 taken 89185 times.
 537076 if(int(o1)*int(o2) > 0) {
184 447891 return;
185 }
186 }
187
188 // If there are two shared vertices, early exit if non-shared
189 // vertex q is not on support plane of [p1,p2,p3]
190
2/2
✓ Branch 0 taken 172018 times.
✓ Branch 1 taken 361461 times.
 533479 if(nb_shared == 2) {
191 172018 int non_shared_q =
192
2/2
✓ Branch 0 taken 57945 times.
✓ Branch 1 taken 114073 times.
 172018 (q_index[1] == NO_INDEX) + (q_index[2] == NO_INDEX)*2;
193
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 172018 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 172018 geo_debug_assert(q_index[non_shared_q] == NO_INDEX);
194 172018 TriangleRegion q = TriangleRegion(T2_RGN_P0 + non_shared_q);
195 TriangleRegion p1,p2,p3;
196
1/2
✓ Branch 1 taken 172018 times.
✗ Branch 2 not taken.
 172018 get_triangle_vertices(T1_RGN_T, p1,p2,p3);
197
3/4
✓ Branch 1 taken 172018 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 160284 times.
✓ Branch 4 taken 11734 times.
 172018 if(orient3d(p1,p2,p3,q) != ZERO) {
198 160284 return;
199 }
200 }
201 }
202
203 // If T1 is strictly on one side of the supporting
204 // plane of T2, then we are sure there is no intersection
205 // and we can stop there.
206 {
207 TriangleRegion p1,p2,p3;
208 TriangleRegion q1,q2,q3;
209
1/2
✓ Branch 1 taken 373195 times.
✗ Branch 2 not taken.
 373195 get_triangle_vertices(T1_RGN_T, p1,p2,p3);
210
1/2
✓ Branch 1 taken 373195 times.
✗ Branch 2 not taken.
 373195 get_triangle_vertices(T2_RGN_T, q1,q2,q3);
211
1/2
✓ Branch 1 taken 373195 times.
✗ Branch 2 not taken.
 373195 Sign o1 = orient3d(q1,q2,q3,p1);
212
1/2
✓ Branch 1 taken 373195 times.
✗ Branch 2 not taken.
 373195 Sign o2 = orient3d(q1,q2,q3,p2);
213
1/2
✓ Branch 1 taken 373195 times.
✗ Branch 2 not taken.
 373195 Sign o3 = orient3d(q1,q2,q3,p3);
214 373195 if(
215
2/2
✓ Branch 0 taken 133125 times.
✓ Branch 1 taken 240070 times.
 373195 int(o1)*int(o2) == 1 &&
216
2/2
✓ Branch 0 taken 87888 times.
✓ Branch 1 taken 45237 times.
 133125 int(o2)*int(o3) == 1 &&
217
1/2
✓ Branch 0 taken 87888 times.
✗ Branch 1 not taken.
 87888 int(o3)*int(o1) == 1
218 ) {
219 87888 return;
220 }
221 }
222
223 285307 intersect_edge_triangle(T1_RGN_E0, T2_RGN_T);
224
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 285307 times.
 285307 if(finished()) { return; }
225 285307 intersect_edge_triangle(T1_RGN_E1, T2_RGN_T);
226
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 285307 times.
 285307 if(finished()) { return; }
227 285307 intersect_edge_triangle(T1_RGN_E2, T2_RGN_T);
228
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 285307 times.
 285307 if(finished()) { return; }
229
230 285307 intersect_edge_triangle(T2_RGN_E0, T1_RGN_T);
231
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 285307 times.
 285307 if(finished()) { return; }
232 285307 intersect_edge_triangle(T2_RGN_E1, T1_RGN_T);
233
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 285307 times.
 285307 if(finished()) { return; }
234 285307 intersect_edge_triangle(T2_RGN_E2, T1_RGN_T);
235
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 285307 times.
 285307 if(finished()) { return; }
236
237 // The same intersection can appear several times,
238 // remove the duplicates
239
1/2
✓ Branch 0 taken 285307 times.
✗ Branch 1 not taken.
 285307 if(result_ != nullptr) {
240 285307 std::sort(result_->begin(), result_->end());
241 285307 auto p = std::unique(result_->begin(), result_->end());
242 285307 result_->resize(index_t(p - result_->begin()));
243 // sort_unique(*result_); // HERE
244 #ifdef TT_DEBUG
245 std::string message;
246 for(TriangleIsect I: *result_) {
247 message += (" " + String::to_string(I));
248 }
249 Logger::out("II") << "result: " << message << std::endl;
250 #endif
251 }
252 }
253
254 /**
255 * \brief Tests if there as a non-degenerate intersection
256 * \retval true if an intersection different from two colocated
257 * vertices was found.
258 * \retval false otherwise.
259 */
260 981370 bool has_non_degenerate_intersection() const {
261 981370 return has_non_degenerate_intersection_;
262 }
263
264 protected:
265
266 /**
267 * \brief Tests whether computation is finished
268 * \details If we just want to know whether there is an intersection
269 * then we can stop sooner.
270 */
271 3416685 bool finished() const {
272 #ifdef TT_DEBUG
273 return false;
274 #endif
275
1/4
✗ Branch 0 not taken.
✓ Branch 1 taken 3416685 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 3416685 return (result_ == nullptr && has_non_degenerate_intersection_);
276 }
277
278 1711842 void intersect_edge_triangle(TriangleRegion E, TriangleRegion T) {
279
280 #ifdef TT_DEBUG
281 Logger::out("TT") << std::endl;
282 Logger::out("TT") << " ET " << std::make_pair(E,T) << std::endl;
283 #endif
284
285
2/8
✓ Branch 1 taken 1711842 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 1711842 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
 1711842 geo_debug_assert(region_dim(E) == 1);
286
2/8
✓ Branch 1 taken 1711842 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 1711842 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
 1711842 geo_debug_assert(region_dim(T) == 2);
287
288 1711842 TriangleRegion R1 = E;
289 1711842 TriangleRegion R2 = T;
290
291 TriangleRegion p1,p2,p3;
292 TriangleRegion e1,e2,e3;
293 TriangleRegion q1,q2;
294
295
1/2
✓ Branch 1 taken 1711842 times.
✗ Branch 2 not taken.
 1711842 get_triangle_vertices(T,p1,p2,p3);
296
1/2
✓ Branch 1 taken 1711842 times.
✗ Branch 2 not taken.
 1711842 get_triangle_edges(T,e1,e2,e3);
297
1/2
✓ Branch 1 taken 1711842 times.
✗ Branch 2 not taken.
 1711842 get_edge_vertices(E,q1,q2);
298
299
1/2
✓ Branch 1 taken 1711842 times.
✗ Branch 2 not taken.
 1711842 Sign o1 = orient3d(p1,p2,p3,q1);
300
1/2
✓ Branch 1 taken 1711842 times.
✗ Branch 2 not taken.
 1711842 Sign o2 = orient3d(p1,p2,p3,q2);
301
302 // If both extremities of the segment on same side of triangle
303 // plane, then we are sure there is no intersection and we can
304 // stop there.
305
2/2
✓ Branch 0 taken 342915 times.
✓ Branch 1 taken 1368927 times.
 1711842 if(int(o1) * int(o2) == 1) {
306 632575 return;
307 }
308
309
4/4
✓ Branch 0 taken 806052 times.
✓ Branch 1 taken 562875 times.
✓ Branch 2 taken 562741 times.
✓ Branch 3 taken 243311 times.
 1368927 if(o1 == 0 && o2 == 0) {
310 #ifdef TT_DEBUG
311 Logger::out("TT") << " ET coplanar" << std::endl;
312 #endif
313 // Special case: triangle and segment are co-planar
314
1/2
✓ Branch 1 taken 562741 times.
✗ Branch 2 not taken.
 562741 index_t nax = normal_axis(p1,p2,p3);
315
316 // Test whether the extremities of the segment
317 // are in the triangle
318 {
319
1/2
✓ Branch 1 taken 562741 times.
✗ Branch 2 not taken.
 562741 Sign a1 = orient2d(q1,p1,p2,nax);
320
1/2
✓ Branch 1 taken 562741 times.
✗ Branch 2 not taken.
 562741 Sign a2 = orient2d(q1,p2,p3,nax);
321
1/2
✓ Branch 1 taken 562741 times.
✗ Branch 2 not taken.
 562741 Sign a3 = orient2d(q1,p3,p1,nax);
322
323
1/2
✓ Branch 1 taken 562741 times.
✗ Branch 2 not taken.
 562741 Sign b1 = orient2d(q2,p1,p2,nax);
324
1/2
✓ Branch 1 taken 562741 times.
✗ Branch 2 not taken.
 562741 Sign b2 = orient2d(q2,p2,p3,nax);
325
1/2
✓ Branch 1 taken 562741 times.
✗ Branch 2 not taken.
 562741 Sign b3 = orient2d(q2,p3,p1,nax);
326
327 562741 if(
328
2/2
✓ Branch 0 taken 118548 times.
✓ Branch 1 taken 444193 times.
 562741 int(a1)*int(a2) > 0 &&
329
2/2
✓ Branch 0 taken 8310 times.
✓ Branch 1 taken 110238 times.
 118548 int(a2)*int(a3) > 0 &&
330
1/2
✓ Branch 0 taken 8310 times.
✗ Branch 1 not taken.
 8310 int(a3)*int(a1) > 0
331 ) {
332
1/2
✓ Branch 1 taken 8310 times.
✗ Branch 2 not taken.
 8310 add_intersection(q1,T);
333
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 8310 times.
 8310 if(finished()) { return; }
334 }
335
336 562741 if(
337
2/2
✓ Branch 0 taken 117757 times.
✓ Branch 1 taken 444984 times.
 562741 int(b1)*int(b2) > 0 &&
338
2/2
✓ Branch 0 taken 8310 times.
✓ Branch 1 taken 109447 times.
 117757 int(b2)*int(b3) > 0 &&
339
1/2
✓ Branch 0 taken 8310 times.
✗ Branch 1 not taken.
 8310 int(b3)*int(b1) > 0
340 ) {
341
1/2
✓ Branch 1 taken 8310 times.
✗ Branch 2 not taken.
 8310 add_intersection(q2,T);
342
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 8310 times.
 8310 if(finished()) { return; }
343 }
344 }
345
346
1/2
✓ Branch 1 taken 562741 times.
✗ Branch 2 not taken.
 562741 intersect_edge_edge_2d(E,e1,nax);
347
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 562741 times.
 562741 if(finished()) { return; }
348
1/2
✓ Branch 1 taken 562741 times.
✗ Branch 2 not taken.
 562741 intersect_edge_edge_2d(E,e2,nax);
349
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 562741 times.
 562741 if(finished()) { return; }
350
1/2
✓ Branch 1 taken 562741 times.
✗ Branch 2 not taken.
 562741 intersect_edge_edge_2d(E,e3,nax);
351
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 562741 times.
 562741 if(finished()) { return; }
352
353 562741 } else {
354
355
356 // Update symbolic information of segment
357 // if one of the segment vertices is on
358 // the triangle's supporting plane.
359
360
2/2
✓ Branch 0 taken 243311 times.
✓ Branch 1 taken 562875 times.
 806186 if(o1 == ZERO) {
361 243311 R1 = q1;
362
2/2
✓ Branch 0 taken 243311 times.
✓ Branch 1 taken 319564 times.
 562875 } else if(o2 == ZERO) {
363 243311 R1 = q2;
364 }
365
366
1/2
✓ Branch 1 taken 806186 times.
✗ Branch 2 not taken.
 806186 Sign oo1 = orient3d(p2,p3,q1,q2);
367
1/2
✓ Branch 1 taken 806186 times.
✗ Branch 2 not taken.
 806186 Sign oo2 = orient3d(p3,p1,q1,q2);
368
369
2/2
✓ Branch 0 taken 289660 times.
✓ Branch 1 taken 516526 times.
 806186 if(int(oo1)*int(oo2) == -1) {
370 289660 return;
371 }
372
373
1/2
✓ Branch 1 taken 516526 times.
✗ Branch 2 not taken.
 516526 Sign oo3 = orient3d(p1,p2,q1,q2);
374
375 // Update symbolic information of triangle
376 // if intersection is
377 // on a vertex or on an edge
378 516526 int nb_zeros = (oo1 == ZERO) + (oo2 == ZERO) + (oo3 == ZERO);
379
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 516526 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 516526 geo_debug_assert(nb_zeros != 3);
380
2/2
✓ Branch 0 taken 45476 times.
✓ Branch 1 taken 471050 times.
 516526 if(nb_zeros == 1) {
381
2/2
✓ Branch 0 taken 22296 times.
✓ Branch 1 taken 23180 times.
 45476 if(oo1 == ZERO) {
382 22296 R2 = e1;
383
2/2
✓ Branch 0 taken 18962 times.
✓ Branch 1 taken 4218 times.
 23180 } else if(oo2 == ZERO) {
384 18962 R2 = e2;
385 } else {
386 4218 R2 = e3;
387 }
388
2/2
✓ Branch 0 taken 267416 times.
✓ Branch 1 taken 203634 times.
 471050 } else if(nb_zeros == 2) {
389
2/2
✓ Branch 0 taken 84829 times.
✓ Branch 1 taken 182587 times.
 267416 if(oo1 != ZERO) {
390 84829 R2 = p1;
391
2/2
✓ Branch 0 taken 87663 times.
✓ Branch 1 taken 94924 times.
 182587 } else if(oo2 != ZERO) {
392 87663 R2 = p2;
393 } else {
394 94924 R2 = p3;
395 }
396 }
397
398 #ifdef TT_DEBUG
399 Logger::out("TT") << o1 << " " << o2
400 << " "
401 << oo1 << " " << oo2 << " " << oo3
402 << std::endl;
403 #endif
404 // Intersection is outside triangle if oo1, oo2 and oo3
405 // do not have the same sign (or zero)
406 516526 bool outside =
407 1033052 (int(oo1) * int(oo2) == -1) ||
408
3/4
✓ Branch 0 taken 516526 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 334664 times.
✓ Branch 3 taken 181862 times.
 851190 (int(oo2) * int(oo3) == -1) ||
409
2/2
✓ Branch 0 taken 13454 times.
✓ Branch 1 taken 321210 times.
 334664 (int(oo3) * int(oo1) == -1) ;
410
411
2/2
✓ Branch 0 taken 321210 times.
✓ Branch 1 taken 195316 times.
 516526 if(!outside) {
412
1/2
✓ Branch 1 taken 321210 times.
✗ Branch 2 not taken.
 321210 add_intersection(R1,R2);
413 }
414 }
415 }
416
417
418 1688223 void intersect_edge_edge_2d(
419 TriangleRegion E1, TriangleRegion E2, index_t nax
420 ) {
421 #ifdef TT_DEBUG
422 Logger::out("TT") << " EE 2d " << std::make_pair(E1,E2)
423 << " axis: " << nax << std::endl;
424 #endif
425
2/8
✓ Branch 1 taken 1688223 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 1688223 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
 1688223 geo_debug_assert(region_dim(E1) == 1);
426
2/8
✓ Branch 1 taken 1688223 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 1688223 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
 1688223 geo_debug_assert(region_dim(E2) == 1);
427
428 1688223 TriangleRegion R1 = E1;
429 1688223 TriangleRegion R2 = E2;
430
431 TriangleRegion p1,p2;
432
1/2
✓ Branch 1 taken 1688223 times.
✗ Branch 2 not taken.
 1688223 get_edge_vertices(E1,p1,p2);
433
434 TriangleRegion q1,q2;
435
1/2
✓ Branch 1 taken 1688223 times.
✗ Branch 2 not taken.
 1688223 get_edge_vertices(E2,q1,q2);
436
437
1/2
✓ Branch 1 taken 1688223 times.
✗ Branch 2 not taken.
 1688223 Sign a1 = orient2d(q1,q2,p1,nax);
438
1/2
✓ Branch 1 taken 1688223 times.
✗ Branch 2 not taken.
 1688223 Sign a2 = orient2d(q1,q2,p2,nax);
439
440
4/4
✓ Branch 0 taken 204517 times.
✓ Branch 1 taken 1483706 times.
✓ Branch 2 taken 36300 times.
✓ Branch 3 taken 168217 times.
 1688223 if(a1 == ZERO && a2 == ZERO) {
441 // Special case: 1D
442 // (the 2x2 edge extremities are aligned)
443
1/2
✓ Branch 1 taken 36300 times.
✗ Branch 2 not taken.
 36300 intersect_edge_edge_1d(E1,E2);
444 } else {
445 // Update symbolic information if one of E1's vertices is
446 // on the supporting line of E2
447
2/2
✓ Branch 0 taken 168217 times.
✓ Branch 1 taken 1483706 times.
 1651923 if(a1 == ZERO) {
448 168217 R1 = p1;
449
2/2
✓ Branch 0 taken 168366 times.
✓ Branch 1 taken 1315340 times.
 1483706 } else if(a2 == ZERO) {
450 168366 R1 = p2;
451 }
452
453
1/2
✓ Branch 1 taken 1651923 times.
✗ Branch 2 not taken.
 1651923 Sign b1 = orient2d(p1,p2,q1,nax);
454
1/2
✓ Branch 1 taken 1651923 times.
✗ Branch 2 not taken.
 1651923 Sign b2 = orient2d(p1,p2,q2,nax);
455
456 // Update symbolic information if one of E2's vertices is
457 // on the supporting line of E1
458
2/2
✓ Branch 0 taken 177691 times.
✓ Branch 1 taken 1474232 times.
 1651923 if(b1 == ZERO) {
459 177691 R2 = q1;
460
2/2
✓ Branch 0 taken 177691 times.
✓ Branch 1 taken 1296541 times.
 1474232 } else if(b2 == ZERO) {
461 177691 R2 = q2;
462 }
463
464
4/4
✓ Branch 0 taken 512569 times.
✓ Branch 1 taken 1139354 times.
✓ Branch 2 taken 396422 times.
✓ Branch 3 taken 116147 times.
 1651923 if( int(a1)*int(a2) != 1 && int(b1)*int(b2) != 1) {
465
1/2
✓ Branch 1 taken 396422 times.
✗ Branch 2 not taken.
 396422 add_intersection(R1,R2);
466 }
467 }
468 1688223 }
469
470 36300 void intersect_edge_edge_1d(
471 TriangleRegion E1, TriangleRegion E2
472 ) {
473 #ifdef TT_DEBUG
474 Logger::out("TT") << " EE 1d " << std::make_pair(E1,E2)
475 << std::endl;
476 #endif
477
2/8
✓ Branch 1 taken 36300 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 36300 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
 36300 geo_debug_assert(region_dim(E1) == 1);
478
2/8
✓ Branch 1 taken 36300 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 36300 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
 36300 geo_debug_assert(region_dim(E2) == 1);
479
480 TriangleRegion p1,p2;
481
1/2
✓ Branch 1 taken 36300 times.
✗ Branch 2 not taken.
 36300 get_edge_vertices(E1,p1,p2);
482
483 TriangleRegion q1,q2;
484
1/2
✓ Branch 1 taken 36300 times.
✗ Branch 2 not taken.
 36300 get_edge_vertices(E2,q1,q2);
485
486
1/2
✓ Branch 1 taken 36300 times.
✗ Branch 2 not taken.
 36300 Sign d1 = dot3d(p1,q1,q2);
487
1/2
✓ Branch 1 taken 36300 times.
✗ Branch 2 not taken.
 36300 Sign d2 = dot3d(p2,q1,q2);
488
1/2
✓ Branch 1 taken 36300 times.
✗ Branch 2 not taken.
 36300 Sign d3 = dot3d(q1,p1,p2);
489
1/2
✓ Branch 1 taken 36300 times.
✗ Branch 2 not taken.
 36300 Sign d4 = dot3d(q2,p1,p2);
490
491 // Test for identical vertices
492 // (small optimization, each time there is an identical pair
493 // of points, the two dot3d predicates they participiate to
494 // should return ZERO, so we can filter)
495
496
9/10
✓ Branch 0 taken 26261 times.
✓ Branch 1 taken 10039 times.
✓ Branch 2 taken 24864 times.
✓ Branch 3 taken 1397 times.
✓ Branch 5 taken 24864 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 1456 times.
✓ Branch 8 taken 23408 times.
✓ Branch 9 taken 1456 times.
✓ Branch 10 taken 34844 times.
 36300 if(d1 == ZERO && d3 == ZERO && points_are_identical(p1,q1)) {
497
1/2
✓ Branch 1 taken 1456 times.
✗ Branch 2 not taken.
 1456 add_intersection(p1,q1);
498 }
499
500
9/10
✓ Branch 0 taken 26263 times.
✓ Branch 1 taken 10037 times.
✓ Branch 2 taken 24865 times.
✓ Branch 3 taken 1398 times.
✓ Branch 5 taken 24865 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 24805 times.
✓ Branch 8 taken 60 times.
✓ Branch 9 taken 24805 times.
✓ Branch 10 taken 11495 times.
 36300 if(d2 == ZERO && d3 == ZERO && points_are_identical(p2,q1)) {
501
1/2
✓ Branch 1 taken 24805 times.
✗ Branch 2 not taken.
 24805 add_intersection(p2,q1);
502 }
503
504
9/10
✓ Branch 0 taken 26261 times.
✓ Branch 1 taken 10039 times.
✓ Branch 2 taken 24865 times.
✓ Branch 3 taken 1396 times.
✓ Branch 5 taken 24865 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 24805 times.
✓ Branch 8 taken 60 times.
✓ Branch 9 taken 24805 times.
✓ Branch 10 taken 11495 times.
 36300 if(d1 == ZERO && d4 == ZERO && points_are_identical(p1,q2)) {
505
1/2
✓ Branch 1 taken 24805 times.
✗ Branch 2 not taken.
 24805 add_intersection(p1,q2);
506 }
507
508
9/10
✓ Branch 0 taken 26263 times.
✓ Branch 1 taken 10037 times.
✓ Branch 2 taken 24866 times.
✓ Branch 3 taken 1397 times.
✓ Branch 5 taken 24866 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 1458 times.
✓ Branch 8 taken 23408 times.
✓ Branch 9 taken 1458 times.
✓ Branch 10 taken 34842 times.
 36300 if(d2 == ZERO && d4 == ZERO && points_are_identical(p2,q2)) {
509
1/2
✓ Branch 1 taken 1458 times.
✗ Branch 2 not taken.
 1458 add_intersection(p2,q2);
510 }
511
512 // Test for point in segment:
513 // c is in segment [a,b] if (c-a).(c-b) < 0
514
515
2/2
✓ Branch 0 taken 178 times.
✓ Branch 1 taken 36122 times.
 36300 if(d1 == NEGATIVE) {
516
1/2
✓ Branch 1 taken 178 times.
✗ Branch 2 not taken.
 178 add_intersection(p1,E2);
517 }
518
519
2/2
✓ Branch 0 taken 178 times.
✓ Branch 1 taken 36122 times.
 36300 if(d2 == NEGATIVE) {
520
1/2
✓ Branch 1 taken 178 times.
✗ Branch 2 not taken.
 178 add_intersection(p2,E2);
521 }
522
523
2/2
✓ Branch 0 taken 178 times.
✓ Branch 1 taken 36122 times.
 36300 if(d3 == NEGATIVE) {
524
1/2
✓ Branch 1 taken 178 times.
✗ Branch 2 not taken.
 178 add_intersection(E1,q1);
525 }
526
527
2/2
✓ Branch 0 taken 178 times.
✓ Branch 1 taken 36122 times.
 36300 if(d4 == NEGATIVE) {
528
1/2
✓ Branch 1 taken 178 times.
✗ Branch 2 not taken.
 178 add_intersection(E1,q2);
529 }
530 36300 }
531
532 787488 void add_intersection(TriangleRegion R1, TriangleRegion R2) {
533 #ifdef TT_DEBUG
534 Logger::out("TT") << " ==>I: " << std::make_pair(R1,R2)
535 << std::endl;
536 #endif
537
6/6
✓ Branch 1 taken 666098 times.
✓ Branch 2 taken 121390 times.
✓ Branch 4 taken 31586 times.
✓ Branch 5 taken 634512 times.
✓ Branch 6 taken 152976 times.
✓ Branch 7 taken 634512 times.
 787488 if(region_dim(R1) >= 1 || region_dim(R2) >= 1) {
538 152976 has_non_degenerate_intersection_ = true;
539 }
540
2/2
✓ Branch 1 taken 381562 times.
✓ Branch 2 taken 405926 times.
 787488 if(is_in_T1(R1)) {
541
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 381562 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 381562 geo_debug_assert(!is_in_T1(R2));
542
1/2
✓ Branch 0 taken 381562 times.
✗ Branch 1 not taken.
 381562 if(result_ != nullptr) {
543
2/4
✓ Branch 1 taken 381562 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 381562 times.
✗ Branch 5 not taken.
 381562 result_->push_back(std::make_pair(R1,R2));
544 }
545 } else {
546
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 405926 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 405926 geo_debug_assert(is_in_T1(R2));
547
1/2
✓ Branch 0 taken 405926 times.
✗ Branch 1 not taken.
 405926 if(result_ != nullptr) {
548
2/4
✓ Branch 1 taken 405926 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 405926 times.
✗ Branch 5 not taken.
 405926 result_->push_back(std::make_pair(R2,R1));
549 }
550 }
551 787488 }
552
553 7918337 Sign orient3d(
554 TriangleRegion i, TriangleRegion j,
555 TriangleRegion k, TriangleRegion l
556 ) const {
557
558
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 7918337 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 7918337 geo_debug_assert(region_dim(i) == 0);
559
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 7918337 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 7918337 geo_debug_assert(region_dim(j) == 0);
560
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 7918337 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 7918337 geo_debug_assert(region_dim(k) == 0);
561
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 7918337 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 7918337 geo_debug_assert(region_dim(l) == 0);
562
563 // Index for the cache (1 bit set for
564 // each vertex)
565
566 7918337 index_t o3d_idx =
567 7918337 (1u << index_t(i)) |
568 7918337 (1u << index_t(j)) |
569 7918337 (1u << index_t(k)) |
570 7918337 (1u << index_t(l)) ;
571
572
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 7918337 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 7918337 geo_debug_assert(o3d_idx < 64);
573
574 // Result of the predicate should be flipped if the
575 // order of the arguments is permutted by an odd permutation
576
577 7918337 bool flip = odd_order(index_t(i),index_t(j),index_t(k),index_t(l));
578
579 // If cache not initialized, set cache value
580
581
2/2
✓ Branch 0 taken 4472496 times.
✓ Branch 1 taken 3445841 times.
 7918337 if(o3d_cache_[o3d_idx] == CACHE_UNINITIALIZED) {
582
2/2
✓ Branch 0 taken 1777576 times.
✓ Branch 1 taken 2694920 times.
 4472496 int o = flip ? -int(PCK::orient_3d(p_[i],p_[j],p_[k],p_[l])) :
583 4472496 int(PCK::orient_3d(p_[i],p_[j],p_[k],p_[l])) ;
584 4472496 o3d_cache_[o3d_idx] = Numeric::int8(o);
585 }
586
587 // Get result from the cache
588
589
2/2
✓ Branch 0 taken 3803286 times.
✓ Branch 1 taken 4115051 times.
 7918337 Sign result = flip ? Sign(-o3d_cache_[o3d_idx])
590 4115051 : Sign( o3d_cache_[o3d_idx]);
591
592 // Sanity check: did our cache return the same result as
593 // directly calling the predicate ?
594
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 7918337 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 7918337 geo_debug_assert(
595 result == PCK::orient_3d(p_[i], p_[j], p_[k], p_[l])
596 );
597
598 7918337 return result;
599 }
600
601 /**
602 * \brief Tests the parity of the permutation of a list of
603 * four distinct indices with respect to the canonical order.
604 */
605 7918337 static bool odd_order(index_t i, index_t j, index_t k, index_t l) {
606 // Implementation: sort the elements (bubble sort is OK for
607 // such a small number), and invert parity each time
608 // two elements are swapped.
609 7918337 index_t tab[4] = { i, j, k, l };
610 7918337 constexpr int N = 4;
611 7918337 bool result = false;
612
2/2
✓ Branch 0 taken 23755011 times.
✓ Branch 1 taken 7918337 times.
 31673348 for (int I = 0; I < N - 1; ++I) {
613
2/2
✓ Branch 0 taken 47510022 times.
✓ Branch 1 taken 23755011 times.
 71265033 for (int J = 0; J < N - I - 1; ++J) {
614
2/2
✓ Branch 0 taken 14431126 times.
✓ Branch 1 taken 33078896 times.
 47510022 if (tab[J] > tab[J + 1]) {
615 14431126 std::swap(tab[J], tab[J + 1]);
616 14431126 result = !result;
617 }
618 }
619 }
620 7918337 return result;
621 }
622
623 10056738 Sign orient2d(
624 TriangleRegion i, TriangleRegion j, TriangleRegion k,
625 index_t normal_axis
626 ) const {
627 // Note: no cache for orient2d (tested, did not bring
628 // any performance gain).
629
2/8
✓ Branch 1 taken 10056738 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 10056738 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
 10056738 geo_debug_assert(region_dim(i) == 0);
630
2/8
✓ Branch 1 taken 10056738 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 10056738 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
 10056738 geo_debug_assert(region_dim(j) == 0);
631
2/8
✓ Branch 1 taken 10056738 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 10056738 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
 10056738 geo_debug_assert(region_dim(k) == 0);
632 double pi[2];
633 double pj[2];
634 double pk[2];
635
2/2
✓ Branch 0 taken 20113476 times.
✓ Branch 1 taken 10056738 times.
 30170214 for(coord_index_t c = 0; c < 2; c++) {
636
1/2
✓ Branch 1 taken 20113476 times.
✗ Branch 2 not taken.
 20113476 pi[c] = p_[i][index_t((normal_axis + 1 + c) % 3)];
637
1/2
✓ Branch 1 taken 20113476 times.
✗ Branch 2 not taken.
 20113476 pj[c] = p_[j][index_t((normal_axis + 1 + c) % 3)];
638
1/2
✓ Branch 1 taken 20113476 times.
✗ Branch 2 not taken.
 20113476 pk[c] = p_[k][index_t((normal_axis + 1 + c) % 3)];
639 }
640
1/2
✓ Branch 1 taken 10056738 times.
✗ Branch 2 not taken.
 20113476 return PCK::orient_2d(pi,pj,pk);
641 }
642
643 /**
644 * \brief Computes the dot product between two vectors supported
645 * by three points.
646 * \param[in] i , j , k the three points
647 * \return sign(dot(pj-pi,pk-pi))
648 */
649 145200 Sign dot3d(
650 TriangleRegion i, TriangleRegion j, TriangleRegion k
651 ) const {
652
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 145200 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 145200 geo_debug_assert(region_dim(i) == 0);
653
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 145200 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 145200 geo_debug_assert(region_dim(j) == 0);
654
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 145200 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 145200 geo_debug_assert(region_dim(k) == 0);
655 145200 return PCK::dot_3d(p_[i].data(), p_[j].data(), p_[k].data());
656 }
657
658
659 /**
660 * \brief Computes the coordinate along which a triangle can be
661 * projected without introducting degeneracies.
662 * \param[in] v1 , v2 , v3 the three vertices of the triangle
663 * \return the coordinate to be used for 2d computations (0,1 or 2)
664 */
665 562741 coord_index_t normal_axis(
666 TriangleRegion v1, TriangleRegion v2, TriangleRegion v3
667 ) {
668
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 562741 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 562741 geo_debug_assert(region_dim(v1) == 0);
669
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 562741 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 562741 geo_debug_assert(region_dim(v2) == 0);
670
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 562741 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 562741 geo_debug_assert(region_dim(v3) == 0);
671
672 562741 const vec3& p1 = p_[v1];
673 562741 const vec3& p2 = p_[v2];
674 562741 const vec3& p3 = p_[v3];
675
676 562741 return PCK::triangle_normal_axis(p1,p2,p3);
677 }
678
679
680 99460 bool points_are_identical(TriangleRegion i, TriangleRegion j) {
681
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 99460 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 99460 geo_debug_assert(region_dim(i) == 0);
682
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 99460 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 99460 geo_debug_assert(region_dim(j) == 0);
683 99460 const vec3& p1 = p_[i];
684 99460 const vec3& p2 = p_[j];
685 return
686 99460 (p1[0] == p2[0]) &&
687
4/4
✓ Branch 0 taken 61656 times.
✓ Branch 1 taken 37804 times.
✓ Branch 4 taken 54444 times.
✓ Branch 5 taken 7212 times.
 153904 (p1[1] == p2[1]) &&
688
2/2
✓ Branch 2 taken 52524 times.
✓ Branch 3 taken 1920 times.
 153904 (p1[2] == p2[2]) ;
689 }
690
691 /**
692 * \brief Detects degenerate triangles
693 * \retval 0 if all the vertices of the triangle are the same point
694 * \retval 1 if the vertices of the triangle are co-linear
695 * \retval 2 otherwise
696 */
697 1962740 index_t triangle_dim(
698 TriangleRegion i, TriangleRegion j, TriangleRegion k
699 ) {
700
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 1962740 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 1962740 geo_debug_assert(region_dim(i) == 0);
701
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 1962740 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 1962740 geo_debug_assert(region_dim(j) == 0);
702
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 1962740 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 1962740 geo_debug_assert(region_dim(k) == 0);
703
704 1962740 const vec3& p1 = p_[i];
705 1962740 const vec3& p2 = p_[j];
706 1962740 const vec3& p3 = p_[k];
707
708
1/2
✓ Branch 4 taken 1962740 times.
✗ Branch 5 not taken.
 1962740 if(!PCK::aligned_3d(p1.data(), p2.data(), p3.data())) {
709 1962740 return 2;
710 }
711 ✗ if(points_are_identical(i,j) && points_are_identical(j,k)) {
712 ✗ return 0;
713 }
714 ✗ return 1;
715 }
716
717
718 private:
719 vec3 p_[6];
720 TriangleIsects* result_;
721 bool has_non_degenerate_intersection_;
722 mutable Numeric::int8 o3d_cache_[64];
723 index_t p_index_[6];
724 bool has_global_indices_;
725 };
726
727 }
728
729 /****************************************************************************/
730
731 namespace GEO {
732
733 ✗ std::string region_to_string(TriangleRegion rgn) {
734 ✗ const char* strs[T_RGN_NB] = {
735 "T1.P0",
736 "T1.P1",
737 "T1.P2",
738
739 "T2.P0",
740 "T2.P1",
741 "T2.P2",
742
743 "T1.E0",
744 "T1.E1",
745 "T1.E2",
746
747 "T2.E0",
748 "T2.E1",
749 "T2.E2",
750
751 "T1.T",
752 "T2.T"
753 };
754 ✗ geo_assert(int(rgn) < int(T_RGN_NB));
755 ✗ return strs[int(rgn)];
756 }
757
758 // This version returns the symbolic information.
759 ✗ bool triangles_intersections(
760 const vec3& p0, const vec3& p1, const vec3& p2,
761 const vec3& q0, const vec3& q1, const vec3& q2,
762 TriangleIsects& result
763 ) {
764 ✗ result.resize(0);
765 TriangleTriangleIntersection I(
766 p0, p1, p2,
767 q0, q1, q2,
768 &result
769 ✗ );
770 ✗ I.compute();
771 ✗ return I.has_non_degenerate_intersection();
772 }
773
774 // This version returns the symbolic information.
775 981370 bool triangles_intersections(
776 const vec3& p0, const vec3& p1, const vec3& p2,
777 const vec3& q0, const vec3& q1, const vec3& q2,
778 index_t p0_index, index_t p1_index, index_t p2_index,
779 index_t q0_index, index_t q1_index, index_t q2_index,
780 TriangleIsects& result
781 ) {
782
1/2
✓ Branch 1 taken 981370 times.
✗ Branch 2 not taken.
 981370 result.resize(0);
783 TriangleTriangleIntersection I(
784 p0, p1, p2,
785 q0, q1, q2,
786 p0_index, p1_index, p2_index,
787 q0_index, q1_index, q2_index,
788 &result
789
1/2
✓ Branch 1 taken 981370 times.
✗ Branch 2 not taken.
 981370 );
790
1/2
✓ Branch 1 taken 981370 times.
✗ Branch 2 not taken.
 981370 I.compute();
791 1962740 return I.has_non_degenerate_intersection();
792 }
793
794 // This version is just a predicate (returns true if
795 // there is a non-degenerate intersection, false
796 // otherwise).
797 ✗ bool triangles_intersections(
798 const vec3& p0, const vec3& p1, const vec3& p2,
799 const vec3& q0, const vec3& q1, const vec3& q2
800 ) {
801 TriangleTriangleIntersection I(
802 p0, p1, p2,
803 q0, q1, q2
804 ✗ );
805 ✗ I.compute();
806 ✗ return I.has_non_degenerate_intersection();
807 }
808
809 91888581 coord_index_t region_dim(TriangleRegion r) {
810
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 91888581 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 91888581 geo_debug_assert(index_t(r) < T_RGN_NB);
811 static coord_index_t trgl_rgn_dim[T_RGN_NB] = {
812 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2
813 };
814 91888581 return trgl_rgn_dim[index_t(r)];
815 }
816
817 271532 TriangleRegion swap_T1_T2(TriangleRegion R) {
818 271532 TriangleRegion result=T_RGN_NB;
819
14/16
✓ Branch 0 taken 4412 times.
✓ Branch 1 taken 3716 times.
✓ Branch 2 taken 4710 times.
✓ Branch 3 taken 5967 times.
✓ Branch 4 taken 3668 times.
✓ Branch 5 taken 4017 times.
✓ Branch 6 taken 32368 times.
✓ Branch 7 taken 28817 times.
✓ Branch 8 taken 35691 times.
✓ Branch 9 taken 32861 times.
✓ Branch 10 taken 28566 times.
✓ Branch 11 taken 36309 times.
✓ Branch 12 taken 26052 times.
✓ Branch 13 taken 24378 times.
✗ Branch 14 not taken.
✗ Branch 15 not taken.
 271532 switch(R) {
820 4412 case T1_RGN_P0:
821 4412 result = T2_RGN_P0;
822 4412 break;
823 3716 case T1_RGN_P1:
824 3716 result = T2_RGN_P1;
825 3716 break;
826 4710 case T1_RGN_P2:
827 4710 result = T2_RGN_P2;
828 4710 break;
829 5967 case T2_RGN_P0:
830 5967 result = T1_RGN_P0;
831 5967 break;
832 3668 case T2_RGN_P1:
833 3668 result = T1_RGN_P1;
834 3668 break;
835 4017 case T2_RGN_P2:
836 4017 result = T1_RGN_P2;
837 4017 break;
838 32368 case T1_RGN_E0:
839 32368 result = T2_RGN_E0;
840 32368 break;
841 28817 case T1_RGN_E1:
842 28817 result = T2_RGN_E1;
843 28817 break;
844 35691 case T1_RGN_E2:
845 35691 result = T2_RGN_E2;
846 35691 break;
847 32861 case T2_RGN_E0:
848 32861 result = T1_RGN_E0;
849 32861 break;
850 28566 case T2_RGN_E1:
851 28566 result = T1_RGN_E1;
852 28566 break;
853 36309 case T2_RGN_E2:
854 36309 result = T1_RGN_E2;
855 36309 break;
856 26052 case T1_RGN_T:
857 26052 result = T2_RGN_T;
858 26052 break;
859 24378 case T2_RGN_T:
860 24378 result = T1_RGN_T;
861 24378 break;
862 ✗ case T_RGN_NB:
863 ✗ geo_assert_not_reached;
864 }
865 271532 return result;
866 }
867
868 3167326 void get_triangle_vertices(
869 TriangleRegion T,
870 TriangleRegion& p0, TriangleRegion& p1, TriangleRegion& p2
871 ) {
872
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 3167326 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 3167326 geo_debug_assert(region_dim(T) == 2);
873
2/3
✓ Branch 0 taken 1938210 times.
✓ Branch 1 taken 1229116 times.
✗ Branch 2 not taken.
 3167326 switch(T) {
874 1938210 case T1_RGN_T: {
875 1938210 p0 = T1_RGN_P0; p1 = T1_RGN_P1; p2 = T1_RGN_P2;
876 1938210 } break;
877 1229116 case T2_RGN_T: {
878 1229116 p0 = T2_RGN_P0; p1 = T2_RGN_P1; p2 = T2_RGN_P2;
879 1229116 } break;
880 ✗ default:
881 ✗ geo_assert_not_reached;
882 }
883 3167326 }
884
885 1711842 void get_triangle_edges(
886 TriangleRegion T,
887 TriangleRegion& e0, TriangleRegion& e1, TriangleRegion& e2
888 ) {
889
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 1711842 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 1711842 geo_debug_assert(region_dim(T) == 2);
890
2/3
✓ Branch 0 taken 855921 times.
✓ Branch 1 taken 855921 times.
✗ Branch 2 not taken.
 1711842 switch(T) {
891 855921 case T1_RGN_T: {
892 855921 e0 = T1_RGN_E0; e1 = T1_RGN_E1; e2 = T1_RGN_E2;
893 855921 } break;
894 855921 case T2_RGN_T: {
895 855921 e0 = T2_RGN_E0; e1 = T2_RGN_E1; e2 = T2_RGN_E2;
896 855921 } break;
897 ✗ default:
898 ✗ geo_assert_not_reached;
899 }
900 1711842 }
901
902 5227165 void get_edge_vertices(
903 TriangleRegion E, TriangleRegion& q0, TriangleRegion& q1
904 ) {
905
1/6
✗ Branch 1 not taken.
✓ Branch 2 taken 5227165 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 5227165 geo_debug_assert(region_dim(E) == 1);
906
6/7
✓ Branch 0 taken 881022 times.
✓ Branch 1 taken 869433 times.
✓ Branch 2 taken 871371 times.
✓ Branch 3 taken 866727 times.
✓ Branch 4 taken 872561 times.
✓ Branch 5 taken 866051 times.
✗ Branch 6 not taken.
 5227165 switch(E) {
907 881022 case T1_RGN_E0: {
908 881022 q0 = T1_RGN_P1;
909 881022 q1 = T1_RGN_P2;
910 881022 } break;
911 869433 case T1_RGN_E1: {
912 869433 q0 = T1_RGN_P2;
913 869433 q1 = T1_RGN_P0;
914 869433 } break;
915 871371 case T1_RGN_E2: {
916 871371 q0 = T1_RGN_P0;
917 871371 q1 = T1_RGN_P1;
918 871371 } break;
919 866727 case T2_RGN_E0: {
920 866727 q0 = T2_RGN_P1;
921 866727 q1 = T2_RGN_P2;
922 866727 } break;
923 872561 case T2_RGN_E1: {
924 872561 q0 = T2_RGN_P2;
925 872561 q1 = T2_RGN_P0;
926 872561 } break;
927 866051 case T2_RGN_E2: {
928 866051 q0 = T2_RGN_P0;
929 866051 q1 = T2_RGN_P1;
930 866051 } break;
931 ✗ default:
932 ✗ geo_assert_not_reached;
933 }
934 5227165 }
935
936 328516 TriangleRegion GEOGRAM_API regions_convex_hull(
937 TriangleRegion R1, TriangleRegion R2
938 ) {
939
1/6
✗ Branch 2 not taken.
✓ Branch 3 taken 328516 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
 328516 geo_debug_assert(is_in_T1(R1) == is_in_T1(R2));
940
2/2
✓ Branch 0 taken 122223 times.
✓ Branch 1 taken 206293 times.
 328516 if(R1 == R2) {
941 122223 return R1;
942 }
943
944
2/2
✓ Branch 1 taken 126121 times.
✓ Branch 2 taken 80172 times.
 206293 TriangleRegion R = is_in_T1(R1) ? T1_RGN_T : T2_RGN_T;
945
946
6/6
✓ Branch 1 taken 160491 times.
✓ Branch 2 taken 45802 times.
✓ Branch 4 taken 17150 times.
✓ Branch 5 taken 143341 times.
✓ Branch 6 taken 17150 times.
✓ Branch 7 taken 189143 times.
 206293 if(region_dim(R1) == 1 && region_dim(R2) == 0) {
947 TriangleRegion v1,v2;
948
1/2
✓ Branch 1 taken 17150 times.
✗ Branch 2 not taken.
 17150 get_edge_vertices(R1,v1,v2);
949
4/4
✓ Branch 0 taken 9484 times.
✓ Branch 1 taken 7666 times.
✓ Branch 2 taken 7579 times.
✓ Branch 3 taken 1905 times.
 17150 if(R2 == v1 || R2 == v2) {
950 15245 R = R1;
951 }
952
6/6
✓ Branch 1 taken 155183 times.
✓ Branch 2 taken 33960 times.
✓ Branch 4 taken 14650 times.
✓ Branch 5 taken 140533 times.
✓ Branch 6 taken 14650 times.
✓ Branch 7 taken 174493 times.
 189143 } else if(region_dim(R2) == 1 && region_dim(R1) == 0) {
953 TriangleRegion v1,v2;
954
1/2
✓ Branch 1 taken 14650 times.
✗ Branch 2 not taken.
 14650 get_edge_vertices(R2,v1,v2);
955
4/4
✓ Branch 0 taken 8345 times.
✓ Branch 1 taken 6305 times.
✓ Branch 2 taken 6394 times.
✓ Branch 3 taken 1951 times.
 14650 if(R1 == v1 || R1 == v2) {
956 12699 R = R2;
957 }
958
6/6
✓ Branch 1 taken 10417 times.
✓ Branch 2 taken 164076 times.
✓ Branch 4 taken 10237 times.
✓ Branch 5 taken 180 times.
✓ Branch 6 taken 10237 times.
✓ Branch 7 taken 164256 times.
 174493 } else if(region_dim(R1) == 0 && region_dim(R2) == 0) {
959 34477 for(TriangleRegion E: {
960 T1_RGN_E0, T1_RGN_E1, T1_RGN_E2,
961 T2_RGN_E0, T2_RGN_E1, T2_RGN_E2
962
1/2
✓ Branch 2 taken 34477 times.
✗ Branch 3 not taken.
 44714 }
963 ) {
964 TriangleRegion v1,v2;
965
1/2
✓ Branch 1 taken 34477 times.
✗ Branch 2 not taken.
 34477 get_edge_vertices(E,v1,v2);
966
8/8
✓ Branch 0 taken 6739 times.
✓ Branch 1 taken 27738 times.
✓ Branch 2 taken 2336 times.
✓ Branch 3 taken 4403 times.
✓ Branch 4 taken 8929 times.
✓ Branch 5 taken 21145 times.
✓ Branch 6 taken 5834 times.
✓ Branch 7 taken 3095 times.
 34477 if((R1 == v1 && R2 == v2) || (R1 == v2 && R2 == v1)) {
967 10237 R = E;
968 10237 break;
969 }
970 }
971 }
972
973 206293 return R;
974 }
975
976 }
977