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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
|
/*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
/** \file
* \ingroup bli
*/
/* The #blender::meshintersect API needs GMP. */
#ifdef WITH_GMP
# include <algorithm>
# include <fstream>
# include <iostream>
# include "BLI_allocator.hh"
# include "BLI_array.hh"
# include "BLI_assert.h"
# include "BLI_delaunay_2d.h"
# include "BLI_double3.hh"
# include "BLI_float3.hh"
# include "BLI_hash.hh"
# include "BLI_kdopbvh.h"
# include "BLI_map.hh"
# include "BLI_math_boolean.hh"
# include "BLI_math_mpq.hh"
# include "BLI_mpq2.hh"
# include "BLI_mpq3.hh"
# include "BLI_span.hh"
# include "BLI_task.h"
# include "BLI_threads.h"
# include "BLI_vector.hh"
# include "BLI_vector_set.hh"
# include "PIL_time.h"
# include "BLI_mesh_intersect.hh"
// # define PERFDEBUG
namespace blender::meshintersect {
# ifdef PERFDEBUG
static void perfdata_init(void);
static void incperfcount(int countnum);
static void bumpperfcount(int countnum, int amt);
static void doperfmax(int maxnum, int val);
static void dump_perfdata(void);
# endif
/** For debugging, can disable threading in intersect code with this static constant. */
static constexpr bool intersect_use_threading = true;
Vert::Vert(const mpq3 &mco, const double3 &dco, int id, int orig)
: co_exact(mco), co(dco), id(id), orig(orig)
{
}
bool Vert::operator==(const Vert &other) const
{
return this->co_exact == other.co_exact;
}
uint64_t Vert::hash() const
{
return co_exact.hash();
}
std::ostream &operator<<(std::ostream &os, const Vert *v)
{
constexpr int dbg_level = 0;
os << "v" << v->id;
if (v->orig != NO_INDEX) {
os << "o" << v->orig;
}
os << v->co;
if (dbg_level > 0) {
os << "=" << v->co_exact;
}
return os;
}
bool Plane::operator==(const Plane &other) const
{
return norm_exact == other.norm_exact && d_exact == other.d_exact;
}
void Plane::make_canonical()
{
if (norm_exact[0] != 0) {
mpq_class den = norm_exact[0];
norm_exact = mpq3(1, norm_exact[1] / den, norm_exact[2] / den);
d_exact = d_exact / den;
}
else if (norm_exact[1] != 0) {
mpq_class den = norm_exact[1];
norm_exact = mpq3(0, 1, norm_exact[2] / den);
d_exact = d_exact / den;
}
else {
if (norm_exact[2] != 0) {
mpq_class den = norm_exact[2];
norm_exact = mpq3(0, 0, 1);
d_exact = d_exact / den;
}
else {
/* A degenerate plane. */
d_exact = 0;
}
}
norm = double3(norm_exact[0].get_d(), norm_exact[1].get_d(), norm_exact[2].get_d());
d = d_exact.get_d();
}
Plane::Plane(const mpq3 &norm_exact, const mpq_class &d_exact)
: norm_exact(norm_exact), d_exact(d_exact)
{
norm = double3(norm_exact[0].get_d(), norm_exact[1].get_d(), norm_exact[2].get_d());
d = d_exact.get_d();
}
Plane::Plane(const double3 &norm, const double d) : norm(norm), d(d)
{
norm_exact = mpq3(0, 0, 0); /* Marks as "exact not yet populated". */
}
/** This is wrong for degenerate planes, but we don't expect to call it on those. */
bool Plane::exact_populated() const
{
return norm_exact[0] != 0 || norm_exact[1] != 0 || norm_exact[2] != 0;
}
uint64_t Plane::hash() const
{
constexpr uint64_t h1 = 33;
constexpr uint64_t h2 = 37;
constexpr uint64_t h3 = 39;
uint64_t hashx = hash_mpq_class(this->norm_exact.x);
uint64_t hashy = hash_mpq_class(this->norm_exact.y);
uint64_t hashz = hash_mpq_class(this->norm_exact.z);
uint64_t hashd = hash_mpq_class(this->d_exact);
uint64_t ans = hashx ^ (hashy * h1) ^ (hashz * h1 * h2) ^ (hashd * h1 * h2 * h3);
return ans;
}
std::ostream &operator<<(std::ostream &os, const Plane *plane)
{
os << "[" << plane->norm << ";" << plane->d << "]";
return os;
}
Face::Face(
Span<const Vert *> verts, int id, int orig, Span<int> edge_origs, Span<bool> is_intersect)
: vert(verts), edge_orig(edge_origs), is_intersect(is_intersect), id(id), orig(orig)
{
}
Face::Face(Span<const Vert *> verts, int id, int orig) : vert(verts), id(id), orig(orig)
{
}
void Face::populate_plane(bool need_exact)
{
if (plane != nullptr) {
if (!need_exact || plane->exact_populated()) {
return;
}
}
if (need_exact) {
mpq3 normal_exact;
if (vert.size() > 3) {
Array<mpq3> co(vert.size());
for (int i : index_range()) {
co[i] = vert[i]->co_exact;
}
normal_exact = mpq3::cross_poly(co);
}
else {
mpq3 tr02 = vert[0]->co_exact - vert[2]->co_exact;
mpq3 tr12 = vert[1]->co_exact - vert[2]->co_exact;
normal_exact = mpq3::cross(tr02, tr12);
}
mpq_class d_exact = -mpq3::dot(normal_exact, vert[0]->co_exact);
plane = new Plane(normal_exact, d_exact);
}
else {
double3 normal;
if (vert.size() > 3) {
Array<double3> co(vert.size());
for (int i : index_range()) {
co[i] = vert[i]->co;
}
normal = double3::cross_poly(co);
}
else {
double3 tr02 = vert[0]->co - vert[2]->co;
double3 tr12 = vert[1]->co - vert[2]->co;
normal = double3::cross_high_precision(tr02, tr12);
}
double d = -double3::dot(normal, vert[0]->co);
plane = new Plane(normal, d);
}
}
Face::~Face()
{
delete plane;
}
bool Face::operator==(const Face &other) const
{
if (this->size() != other.size()) {
return false;
}
for (FacePos i : index_range()) {
/* Can test pointer equality since we will have
* unique vert pointers for unique co_equal's. */
if (this->vert[i] != other.vert[i]) {
return false;
}
}
return true;
}
bool Face::cyclic_equal(const Face &other) const
{
if (this->size() != other.size()) {
return false;
}
int flen = this->size();
for (FacePos start : index_range()) {
for (FacePos start_other : index_range()) {
bool ok = true;
for (int i = 0; ok && i < flen; ++i) {
FacePos p = (start + i) % flen;
FacePos p_other = (start_other + i) % flen;
if (this->vert[p] != other.vert[p_other]) {
ok = false;
}
}
if (ok) {
return true;
}
}
}
return false;
}
std::ostream &operator<<(std::ostream &os, const Face *f)
{
os << "f" << f->id << "o" << f->orig << "[";
for (const Vert *v : *f) {
os << v;
if (v != f->vert[f->size() - 1]) {
os << " ";
}
}
os << "]";
if (f->orig != NO_INDEX) {
os << "o" << f->orig;
}
os << " e_orig[";
for (int i : f->index_range()) {
os << f->edge_orig[i];
if (f->is_intersect[i]) {
os << "#";
}
if (i != f->size() - 1) {
os << " ";
}
}
os << "]";
return os;
}
/**
* Un-comment the following to try using a spin-lock instead of
* a mutex in the arena allocation routines.
* Initial tests showed that it doesn't seem to help very much,
* if at all, to use a spin-lock.
*/
// #define USE_SPINLOCK
/**
* #IMeshArena is the owner of the Vert and Face resources used
* during a run of one of the mesh-intersect main functions.
* It also keeps has a hash table of all Verts created so that it can
* ensure that only one instance of a Vert with a given co_exact will
* exist. I.e., it de-duplicates the vertices.
*/
class IMeshArena::IMeshArenaImpl : NonCopyable, NonMovable {
/**
* Don't use Vert itself as key since resizing may move
* pointers to the Vert around, and we need to have those pointers
* stay the same throughout the lifetime of the #IMeshArena.
*/
struct VSetKey {
Vert *vert;
VSetKey(Vert *p) : vert(p)
{
}
uint32_t hash() const
{
return vert->hash();
}
bool operator==(const VSetKey &other) const
{
return *this->vert == *other.vert;
}
};
VectorSet<VSetKey> vset_; /* TODO: replace with Set */
/**
* Ownership of the Vert memory is here, so destroying this reclaims that memory.
*
* TODO: replace these with pooled allocation, and just destroy the pools at the end.
*/
Vector<std::unique_ptr<Vert>> allocated_verts_;
Vector<std::unique_ptr<Face>> allocated_faces_;
/* Use these to allocate ids when Verts and Faces are allocated. */
int next_vert_id_ = 0;
int next_face_id_ = 0;
/* Need a lock when multi-threading to protect allocation of new elements. */
# ifdef USE_SPINLOCK
SpinLock lock_;
# else
ThreadMutex *mutex_;
# endif
public:
IMeshArenaImpl()
{
if (intersect_use_threading) {
# ifdef USE_SPINLOCK
BLI_spin_init(&lock_);
# else
mutex_ = BLI_mutex_alloc();
# endif
}
}
~IMeshArenaImpl()
{
if (intersect_use_threading) {
# ifdef USE_SPINLOCK
BLI_spin_end(&lock_);
# else
BLI_mutex_free(mutex_);
# endif
}
}
void reserve(int vert_num_hint, int face_num_hint)
{
vset_.reserve(vert_num_hint);
allocated_verts_.reserve(vert_num_hint);
allocated_faces_.reserve(face_num_hint);
}
int tot_allocated_verts() const
{
return allocated_verts_.size();
}
int tot_allocated_faces() const
{
return allocated_faces_.size();
}
const Vert *add_or_find_vert(const mpq3 &co, int orig)
{
double3 dco(co[0].get_d(), co[1].get_d(), co[2].get_d());
return add_or_find_vert(co, dco, orig);
}
const Vert *add_or_find_vert(const double3 &co, int orig)
{
mpq3 mco(co[0], co[1], co[2]);
return add_or_find_vert(mco, co, orig);
}
Face *add_face(Span<const Vert *> verts, int orig, Span<int> edge_origs, Span<bool> is_intersect)
{
Face *f = new Face(verts, next_face_id_++, orig, edge_origs, is_intersect);
if (intersect_use_threading) {
# ifdef USE_SPINLOCK
BLI_spin_lock(&lock_);
# else
BLI_mutex_lock(mutex_);
# endif
}
allocated_faces_.append(std::unique_ptr<Face>(f));
if (intersect_use_threading) {
# ifdef USE_SPINLOCK
BLI_spin_unlock(&lock_);
# else
BLI_mutex_unlock(mutex_);
# endif
}
return f;
}
Face *add_face(Span<const Vert *> verts, int orig, Span<int> edge_origs)
{
Array<bool> is_intersect(verts.size(), false);
return add_face(verts, orig, edge_origs, is_intersect);
}
Face *add_face(Span<const Vert *> verts, int orig)
{
Array<int> edge_origs(verts.size(), NO_INDEX);
Array<bool> is_intersect(verts.size(), false);
return add_face(verts, orig, edge_origs, is_intersect);
}
const Vert *find_vert(const mpq3 &co)
{
const Vert *ans;
Vert vtry(co, double3(), NO_INDEX, NO_INDEX);
VSetKey vskey(&vtry);
if (intersect_use_threading) {
# ifdef USE_SPINLOCK
BLI_spin_lock(&lock_);
# else
BLI_mutex_lock(mutex_);
# endif
}
int i = vset_.index_of_try(vskey);
if (i == -1) {
ans = nullptr;
}
else {
ans = vset_[i].vert;
}
if (intersect_use_threading) {
# ifdef USE_SPINLOCK
BLI_spin_unlock(&lock_);
# else
BLI_mutex_unlock(mutex_);
# endif
}
return ans;
}
/**
* This is slow. Only used for unit tests right now.
* Since it is only used for that purpose, access is not lock-protected.
* The argument vs can be a cyclic shift of the actual stored Face.
*/
const Face *find_face(Span<const Vert *> vs)
{
Array<int> eorig(vs.size(), NO_INDEX);
Array<bool> is_intersect(vs.size(), false);
Face ftry(vs, NO_INDEX, NO_INDEX, eorig, is_intersect);
for (const int i : allocated_faces_.index_range()) {
if (ftry.cyclic_equal(*allocated_faces_[i])) {
return allocated_faces_[i].get();
}
}
return nullptr;
}
private:
const Vert *add_or_find_vert(const mpq3 &mco, const double3 &dco, int orig)
{
/* Don't allocate Vert yet, in case it is already there. */
Vert vtry(mco, dco, NO_INDEX, NO_INDEX);
const Vert *ans;
VSetKey vskey(&vtry);
if (intersect_use_threading) {
# ifdef USE_SPINLOCK
BLI_spin_lock(&lock_);
# else
BLI_mutex_lock(mutex_);
# endif
}
int i = vset_.index_of_try(vskey);
if (i == -1) {
vskey.vert = new Vert(mco, dco, next_vert_id_++, orig);
vset_.add_new(vskey);
allocated_verts_.append(std::unique_ptr<Vert>(vskey.vert));
ans = vskey.vert;
}
else {
/* It was a duplicate, so return the existing one.
* Note that the returned Vert may have a different orig.
* This is the intended semantics: if the Vert already
* exists then we are merging verts and using the first-seen
* one as the canonical one. */
ans = vset_[i].vert;
}
if (intersect_use_threading) {
# ifdef USE_SPINLOCK
BLI_spin_unlock(&lock_);
# else
BLI_mutex_unlock(mutex_);
# endif
}
return ans;
};
};
IMeshArena::IMeshArena()
{
pimpl_ = std::unique_ptr<IMeshArenaImpl>(new IMeshArenaImpl());
}
IMeshArena::~IMeshArena()
{
}
void IMeshArena::reserve(int vert_num_hint, int face_num_hint)
{
pimpl_->reserve(vert_num_hint, face_num_hint);
}
int IMeshArena::tot_allocated_verts() const
{
return pimpl_->tot_allocated_verts();
}
int IMeshArena::tot_allocated_faces() const
{
return pimpl_->tot_allocated_faces();
}
const Vert *IMeshArena::add_or_find_vert(const mpq3 &co, int orig)
{
return pimpl_->add_or_find_vert(co, orig);
}
Face *IMeshArena::add_face(Span<const Vert *> verts,
int orig,
Span<int> edge_origs,
Span<bool> is_intersect)
{
return pimpl_->add_face(verts, orig, edge_origs, is_intersect);
}
Face *IMeshArena::add_face(Span<const Vert *> verts, int orig, Span<int> edge_origs)
{
return pimpl_->add_face(verts, orig, edge_origs);
}
Face *IMeshArena::add_face(Span<const Vert *> verts, int orig)
{
return pimpl_->add_face(verts, orig);
}
const Vert *IMeshArena::add_or_find_vert(const double3 &co, int orig)
{
return pimpl_->add_or_find_vert(co, orig);
}
const Vert *IMeshArena::find_vert(const mpq3 &co) const
{
return pimpl_->find_vert(co);
}
const Face *IMeshArena::find_face(Span<const Vert *> verts) const
{
return pimpl_->find_face(verts);
}
void IMesh::set_faces(Span<Face *> faces)
{
face_ = faces;
}
int IMesh::lookup_vert(const Vert *v) const
{
BLI_assert(vert_populated_);
return vert_to_index_.lookup_default(v, NO_INDEX);
}
void IMesh::populate_vert()
{
/* This is likely an overestimate, since verts are shared between
* faces. It is ok if estimate is over or even under. */
constexpr int ESTIMATE_VERTS_PER_FACE = 4;
int estimate_num_verts = ESTIMATE_VERTS_PER_FACE * face_.size();
populate_vert(estimate_num_verts);
}
void IMesh::populate_vert(int max_verts)
{
if (vert_populated_) {
return;
}
vert_to_index_.reserve(max_verts);
int next_allocate_index = 0;
for (const Face *f : face_) {
for (const Vert *v : *f) {
if (v->id == 1) {
}
int index = vert_to_index_.lookup_default(v, NO_INDEX);
if (index == NO_INDEX) {
BLI_assert(next_allocate_index < UINT_MAX - 2);
vert_to_index_.add(v, next_allocate_index++);
}
}
}
int tot_v = next_allocate_index;
vert_ = Array<const Vert *>(tot_v);
for (auto item : vert_to_index_.items()) {
int index = item.value;
BLI_assert(index < tot_v);
vert_[index] = item.key;
}
/* Easier debugging (at least when there are no merged input verts)
* if output vert order is same as input, with new verts at the end.
* TODO: when all debugged, set fix_order = false. */
const bool fix_order = true;
if (fix_order) {
std::sort(vert_.begin(), vert_.end(), [](const Vert *a, const Vert *b) {
if (a->orig != NO_INDEX && b->orig != NO_INDEX) {
return a->orig < b->orig;
}
if (a->orig != NO_INDEX) {
return true;
}
if (b->orig != NO_INDEX) {
return false;
}
return a->id < b->id;
});
for (int i : vert_.index_range()) {
const Vert *v = vert_[i];
vert_to_index_.add_overwrite(v, i);
}
}
vert_populated_ = true;
}
bool IMesh::erase_face_positions(int f_index, Span<bool> face_pos_erase, IMeshArena *arena)
{
const Face *cur_f = this->face(f_index);
int cur_len = cur_f->size();
int num_to_erase = 0;
for (int i : cur_f->index_range()) {
if (face_pos_erase[i]) {
++num_to_erase;
}
}
if (num_to_erase == 0) {
return false;
}
int new_len = cur_len - num_to_erase;
if (new_len < 3) {
/* This erase causes removal of whole face.
* Because this may be called from a loop over the face array,
* we don't want to compress that array right here; instead will
* mark with null pointer and caller should call remove_null_faces().
* the loop is done.
*/
this->face_[f_index] = NULL;
return true;
}
Array<const Vert *> new_vert(new_len);
Array<int> new_edge_orig(new_len);
Array<bool> new_is_intersect(new_len);
int new_index = 0;
for (int i : cur_f->index_range()) {
if (!face_pos_erase[i]) {
new_vert[new_index] = (*cur_f)[i];
new_edge_orig[new_index] = cur_f->edge_orig[i];
new_is_intersect[new_index] = cur_f->is_intersect[i];
++new_index;
}
}
BLI_assert(new_index == new_len);
this->face_[f_index] = arena->add_face(new_vert, cur_f->orig, new_edge_orig, new_is_intersect);
return false;
}
void IMesh::remove_null_faces()
{
int64_t nullcount = 0;
for (Face *f : this->face_) {
if (f == NULL) {
++nullcount;
}
}
if (nullcount == 0) {
return;
}
int64_t new_size = this->face_.size() - nullcount;
int64_t copy_to_index = 0;
int64_t copy_from_index = 0;
Array<Face *> new_face(new_size);
while (copy_from_index < face_.size()) {
Face *f_from = face_[copy_from_index++];
if (f_from) {
new_face[copy_to_index++] = f_from;
}
}
this->face_ = new_face;
}
std::ostream &operator<<(std::ostream &os, const IMesh &mesh)
{
if (mesh.has_verts()) {
os << "Verts:\n";
int i = 0;
for (const Vert *v : mesh.vertices()) {
os << i << ": " << v << "\n";
++i;
}
}
os << "\nFaces:\n";
int i = 0;
for (const Face *f : mesh.faces()) {
os << i << ": " << f << "\n";
if (f->plane != nullptr) {
os << " plane=" << f->plane << " eorig=[";
for (Face::FacePos p = 0; p < f->size(); ++p) {
os << f->edge_orig[p] << " ";
}
os << "]\n";
}
++i;
}
return os;
}
struct BoundingBox {
float3 min{FLT_MAX, FLT_MAX, FLT_MAX};
float3 max{-FLT_MAX, -FLT_MAX, -FLT_MAX};
BoundingBox() = default;
BoundingBox(const float3 &min, const float3 &max) : min(min), max(max)
{
}
BoundingBox(const BoundingBox &other) : min(other.min), max(other.max)
{
}
BoundingBox(BoundingBox &&other) noexcept : min(std::move(other.min)), max(std::move(other.max))
{
}
~BoundingBox() = default;
BoundingBox operator=(const BoundingBox &other)
{
if (this != &other) {
min = other.min;
max = other.max;
}
return *this;
}
BoundingBox operator=(BoundingBox &&other) noexcept
{
min = std::move(other.min);
max = std::move(other.max);
return *this;
}
void combine(const float3 &p)
{
min.x = min_ff(min.x, p.x);
min.y = min_ff(min.y, p.y);
min.z = min_ff(min.z, p.z);
max.x = max_ff(max.x, p.x);
max.y = max_ff(max.y, p.y);
max.z = max_ff(max.z, p.z);
}
void combine(const double3 &p)
{
min.x = min_ff(min.x, static_cast<float>(p.x));
min.y = min_ff(min.y, static_cast<float>(p.y));
min.z = min_ff(min.z, static_cast<float>(p.z));
max.x = max_ff(max.x, static_cast<float>(p.x));
max.y = max_ff(max.y, static_cast<float>(p.y));
max.z = max_ff(max.z, static_cast<float>(p.z));
}
void combine(const BoundingBox &bb)
{
min.x = min_ff(min.x, bb.min.x);
min.y = min_ff(min.y, bb.min.y);
min.z = min_ff(min.z, bb.min.z);
max.x = max_ff(max.x, bb.max.x);
max.y = max_ff(max.y, bb.max.y);
max.z = max_ff(max.z, bb.max.z);
}
void expand(float pad)
{
min.x -= pad;
min.y -= pad;
min.z -= pad;
max.x += pad;
max.y += pad;
max.z += pad;
}
};
/**
* Assume bounding boxes have been expanded by a sufficient epsilon on all sides
* so that the comparisons against the bb bounds are sufficient to guarantee that
* if an overlap or even touching could happen, this will return true.
*/
static bool bbs_might_intersect(const BoundingBox &bb_a, const BoundingBox &bb_b)
{
return isect_aabb_aabb_v3(bb_a.min, bb_a.max, bb_b.min, bb_b.max);
}
/**
* Data and functions to calculate bounding boxes and pad them, in parallel.
* The bounding box calculation has the additional task of calculating the maximum
* absolute value of any coordinate in the mesh, which will be used to calculate
* the pad value.
*/
struct BBChunkData {
double max_abs_val = 0.0;
};
struct BBCalcData {
const IMesh &im;
Array<BoundingBox> *face_bounding_box;
BBCalcData(const IMesh &im, Array<BoundingBox> *fbb) : im(im), face_bounding_box(fbb){};
};
static void calc_face_bb_range_func(void *__restrict userdata,
const int iter,
const TaskParallelTLS *__restrict tls)
{
BBCalcData *bbdata = static_cast<BBCalcData *>(userdata);
double max_abs = 0.0;
const Face &face = *bbdata->im.face(iter);
BoundingBox &bb = (*bbdata->face_bounding_box)[iter];
for (const Vert *v : face) {
bb.combine(v->co);
for (int i = 0; i < 3; ++i) {
max_abs = max_dd(max_abs, fabs(v->co[i]));
}
}
BBChunkData *chunk = static_cast<BBChunkData *>(tls->userdata_chunk);
chunk->max_abs_val = max_dd(max_abs, chunk->max_abs_val);
}
struct BBPadData {
Array<BoundingBox> *face_bounding_box;
double pad;
BBPadData(Array<BoundingBox> *fbb, double pad) : face_bounding_box(fbb), pad(pad){};
};
static void pad_face_bb_range_func(void *__restrict userdata,
const int iter,
const TaskParallelTLS *__restrict UNUSED(tls))
{
BBPadData *pad_data = static_cast<BBPadData *>(userdata);
(*pad_data->face_bounding_box)[iter].expand(pad_data->pad);
}
static void calc_face_bb_reduce(const void *__restrict UNUSED(userdata),
void *__restrict chunk_join,
void *__restrict chunk)
{
BBChunkData *bbchunk_join = static_cast<BBChunkData *>(chunk_join);
BBChunkData *bbchunk = static_cast<BBChunkData *>(chunk);
bbchunk_join->max_abs_val = max_dd(bbchunk_join->max_abs_val, bbchunk->max_abs_val);
}
/**
* We will expand the bounding boxes by an epsilon on all sides so that
* the "less than" tests in isect_aabb_aabb_v3 are sufficient to detect
* touching or overlap.
*/
static Array<BoundingBox> calc_face_bounding_boxes(const IMesh &m)
{
int n = m.face_size();
Array<BoundingBox> ans(n);
TaskParallelSettings settings;
BBCalcData data(m, &ans);
BBChunkData chunk_data;
BLI_parallel_range_settings_defaults(&settings);
settings.userdata_chunk = &chunk_data;
settings.userdata_chunk_size = sizeof(chunk_data);
settings.func_reduce = calc_face_bb_reduce;
settings.min_iter_per_thread = 1000;
settings.use_threading = intersect_use_threading;
BLI_task_parallel_range(0, n, &data, calc_face_bb_range_func, &settings);
double max_abs_val = chunk_data.max_abs_val;
constexpr float pad_factor = 10.0f;
float pad = max_abs_val == 0.0f ? FLT_EPSILON : 2 * FLT_EPSILON * max_abs_val;
pad *= pad_factor; /* For extra safety. */
TaskParallelSettings pad_settings;
BLI_parallel_range_settings_defaults(&pad_settings);
settings.min_iter_per_thread = 1000;
settings.use_threading = intersect_use_threading;
BBPadData pad_data(&ans, pad);
BLI_task_parallel_range(0, n, &pad_data, pad_face_bb_range_func, &pad_settings);
return ans;
}
/**
* A cluster of co-planar triangles, by index.
* A pair of triangles T0 and T1 is said to "non-trivially co-planar-intersect"
* if they are co-planar, intersect, and their intersection is not just existing
* elements (verts, edges) of both triangles.
* A co-planar cluster is said to be "nontrivial" if it has more than one triangle
* and every triangle in it non-trivially co-planar-intersects with at least one other
* triangle in the cluster.
*/
class CoplanarCluster {
Vector<int> tris_;
BoundingBox bb_;
public:
CoplanarCluster() = default;
CoplanarCluster(int t, const BoundingBox &bb)
{
this->add_tri(t, bb);
}
CoplanarCluster(const CoplanarCluster &other) : tris_(other.tris_), bb_(other.bb_)
{
}
CoplanarCluster(CoplanarCluster &&other) noexcept
: tris_(std::move(other.tris_)), bb_(std::move(other.bb_))
{
}
~CoplanarCluster() = default;
CoplanarCluster &operator=(const CoplanarCluster &other)
{
if (this != &other) {
tris_ = other.tris_;
bb_ = other.bb_;
}
return *this;
}
CoplanarCluster &operator=(CoplanarCluster &&other) noexcept
{
tris_ = std::move(other.tris_);
bb_ = std::move(other.bb_);
return *this;
}
/* Assume that caller knows this will not be a duplicate. */
void add_tri(int t, const BoundingBox &bb)
{
tris_.append(t);
bb_.combine(bb);
}
int tot_tri() const
{
return tris_.size();
}
int tri(int index) const
{
return tris_[index];
}
const int *begin() const
{
return tris_.begin();
}
const int *end() const
{
return tris_.end();
}
const BoundingBox &bounding_box() const
{
return bb_;
}
};
/**
* Maintains indexed set of #CoplanarCluster, with the added ability
* to efficiently find the cluster index of any given triangle
* (the max triangle index needs to be given in the initializer).
* The #tri_cluster(t) function returns -1 if t is not part of any cluster.
*/
class CoplanarClusterInfo {
Vector<CoplanarCluster> clusters_;
Array<int> tri_cluster_;
public:
CoplanarClusterInfo() = default;
explicit CoplanarClusterInfo(int numtri) : tri_cluster_(Array<int>(numtri))
{
tri_cluster_.fill(-1);
}
int tri_cluster(int t) const
{
BLI_assert(t < tri_cluster_.size());
return tri_cluster_[t];
}
int add_cluster(CoplanarCluster cl)
{
int c_index = clusters_.append_and_get_index(cl);
for (int t : cl) {
BLI_assert(t < tri_cluster_.size());
tri_cluster_[t] = c_index;
}
return c_index;
}
int tot_cluster() const
{
return clusters_.size();
}
const CoplanarCluster *begin()
{
return clusters_.begin();
}
const CoplanarCluster *end()
{
return clusters_.end();
}
IndexRange index_range() const
{
return clusters_.index_range();
}
const CoplanarCluster &cluster(int index) const
{
BLI_assert(index < clusters_.size());
return clusters_[index];
}
};
static std::ostream &operator<<(std::ostream &os, const CoplanarCluster &cl);
static std::ostream &operator<<(std::ostream &os, const CoplanarClusterInfo &clinfo);
enum ITT_value_kind { INONE, IPOINT, ISEGMENT, ICOPLANAR };
struct ITT_value {
enum ITT_value_kind kind;
mpq3 p1; /* Only relevant for IPOINT and ISEGMENT kind. */
mpq3 p2; /* Only relevant for ISEGMENT kind. */
int t_source; /* Index of the source triangle that intersected the target one. */
ITT_value() : kind(INONE), t_source(-1)
{
}
ITT_value(ITT_value_kind k) : kind(k), t_source(-1)
{
}
ITT_value(ITT_value_kind k, int tsrc) : kind(k), t_source(tsrc)
{
}
ITT_value(ITT_value_kind k, const mpq3 &p1) : kind(k), p1(p1), t_source(-1)
{
}
ITT_value(ITT_value_kind k, const mpq3 &p1, const mpq3 &p2)
: kind(k), p1(p1), p2(p2), t_source(-1)
{
}
ITT_value(const ITT_value &other)
: kind(other.kind), p1(other.p1), p2(other.p2), t_source(other.t_source)
{
}
ITT_value(ITT_value &&other) noexcept
: kind(other.kind),
p1(std::move(other.p1)),
p2(std::move(other.p2)),
t_source(other.t_source)
{
}
~ITT_value()
{
}
ITT_value &operator=(const ITT_value &other)
{
if (this != &other) {
kind = other.kind;
p1 = other.p1;
p2 = other.p2;
t_source = other.t_source;
}
return *this;
}
ITT_value &operator=(ITT_value &&other) noexcept
{
kind = other.kind;
p1 = std::move(other.p1);
p2 = std::move(other.p2);
t_source = other.t_source;
return *this;
}
};
static std::ostream &operator<<(std::ostream &os, const ITT_value &itt);
/**
* Project a 3d vert to a 2d one by eliding proj_axis. This does not create
* degeneracies as long as the projection axis is one where the corresponding
* component of the originating plane normal is non-zero.
*/
static mpq2 project_3d_to_2d(const mpq3 &p3d, int proj_axis)
{
mpq2 p2d;
switch (proj_axis) {
case (0): {
p2d[0] = p3d[1];
p2d[1] = p3d[2];
break;
}
case (1): {
p2d[0] = p3d[0];
p2d[1] = p3d[2];
break;
}
case (2): {
p2d[0] = p3d[0];
p2d[1] = p3d[1];
break;
}
default:
BLI_assert(false);
}
return p2d;
}
/**
* The sup and index functions are defined in the paper:
* EXACT GEOMETRIC COMPUTATION USING CASCADING, by
* Burnikel, Funke, and Seel. They are used to find absolute
* bounds on the error due to doing a calculation in double
* instead of exactly. For calculations involving only +, -, and *,
* the supremum is the same function except using absolute values
* on inputs and using + instead of -.
* The index function follows these rules:
* index(x op y) = 1 + max(index(x), index(y)) for op + or -
* index(x * y) = 1 + index(x) + index(y)
* index(x) = 0 if input x can be represented exactly as a double
* index(x) = 1 otherwise.
*
* With these rules in place, we know an absolute error bound:
*
* |E_exact - E| <= supremum(E) * index(E) * DBL_EPSILON
*
* where E_exact is what would have been the exact value of the
* expression and E is the one calculated with doubles.
*
* So the sign of E is the same as the sign of E_exact if
* |E| > supremum(E) * index(E) * DBL_EPSILON
*
* Note: a possible speedup would be to have a simple function
* that calculates the error bound if one knows that all values
* are less than some global maximum - most of the function would
* be calculated ahead of time. The global max could be passed
* from above.
*/
static double supremum_dot_cross(const double3 &a, const double3 &b)
{
double3 abs_a = double3::abs(a);
double3 abs_b = double3::abs(b);
double3 c;
/* This is dot(cross(a, b), cross(a,b)) but using absolute values for a and b
* and always using + when operation is + or -. */
c[0] = abs_a[1] * abs_b[2] + abs_a[2] * abs_b[1];
c[1] = abs_a[2] * abs_b[0] + abs_a[0] * abs_b[2];
c[2] = abs_a[0] * abs_b[1] + abs_a[1] * abs_b[0];
return double3::dot(c, c);
}
/* The index of dot when inputs are plane_coords with index 1 is much higher.
* Plane coords have index 6.
*/
constexpr int index_dot_plane_coords = 15;
/**
* Used with supremum to get error bound. See Burnikel et al paper.
* index_plane_coord is the index of a plane coordinate calculated
* for a triangle using the usual formula, assuming the input
* coordinates have index 1.
* index_cross is the index of each coordinate of the cross product.
* It is actually 2 + 2 * (max index of input coords).
* index_dot_cross is the index of the dot product of two cross products.
* It is actually 7 + 4 * (max index of input coords)
*/
constexpr int index_dot_cross = 11;
/**
* Return the approximate side of point p on a plane with normal plane_no and point plane_p.
* The answer will be 1 if p is definitely above the plane, -1 if it is definitely below.
* If the answer is 0, we are unsure about which side of the plane (or if it is on the plane).
* In exact arithmetic, the answer is just `sgn(dot(p - plane_p, plane_no))`.
*
* The plane_no input is constructed, so has a higher index.
*/
constexpr int index_plane_side = 3 + 2 * index_dot_plane_coords;
static int filter_plane_side(const double3 &p,
const double3 &plane_p,
const double3 &plane_no,
const double3 &abs_p,
const double3 &abs_plane_p,
const double3 &abs_plane_no)
{
double d = double3::dot(p - plane_p, plane_no);
if (d == 0.0) {
return 0;
}
double supremum = double3::dot(abs_p + abs_plane_p, abs_plane_no);
double err_bound = supremum * index_plane_side * DBL_EPSILON;
if (fabs(d) > err_bound) {
return d > 0 ? 1 : -1;
}
return 0;
}
/*
* interesect_tri_tri and helper functions.
* This code uses the algorithm of Guigue and Devillers, as described
* in "Faster Triangle-Triangle Intersection Tests".
* Adapted from github code by Eric Haines:
* github.com/erich666/jgt-code/tree/master/Volume_08/Number_1/Guigue2003
*/
/**
* Return the point on ab where the plane with normal n containing point c intersects it.
* Assumes ab is not perpendicular to n.
* This works because the ratio of the projections of ab and ac onto n is the same as
* the ratio along the line ab of the intersection point to the whole of ab.
*/
static inline mpq3 tti_interp(const mpq3 &a, const mpq3 &b, const mpq3 &c, const mpq3 &n)
{
mpq3 ab = a - b;
mpq_class den = mpq3::dot(ab, n);
BLI_assert(den != 0);
mpq_class alpha = mpq3::dot(a - c, n) / den;
return a - alpha * ab;
}
/**
* Return +1, 0, -1 as a + ad is above, on, or below the oriented plane containing a, b, c in CCW
* order. This is the same as -oriented(a, b, c, a + ad), but uses fewer arithmetic operations.
* TODO: change arguments to `const Vert *` and use floating filters.
*/
static inline int tti_above(const mpq3 &a, const mpq3 &b, const mpq3 &c, const mpq3 &ad)
{
mpq3 n = mpq3::cross(b - a, c - a);
return sgn(mpq3::dot(ad, n));
}
/**
* Given that triangles (p1, q1, r1) and (p2, q2, r2) are in canonical order,
* use the classification chart in the Guigue and Devillers paper to find out
* how the intervals [i,j] and [k,l] overlap, where [i,j] is where p1r1 and p1q1
* intersect the plane-plane intersection line, L, and [k,l] is where p2q2 and p2r2
* intersect L. By the canonicalization, those segments intersect L exactly once.
* Canonicalization has made it so that for p1, q1, r1, either:
* (a)) p1 is off the second triangle's plane and both q1 and r1 are either
* on the plane or on the other side of it from p1; or
* (b) p1 is on the plane both q1 and r1 are on the same side
* of the plane and at least one of q1 and r1 are off the plane.
* Similarly for p2, q2, r2 with respect to the first triangle's plane.
*/
static ITT_value itt_canon2(const mpq3 &p1,
const mpq3 &q1,
const mpq3 &r1,
const mpq3 &p2,
const mpq3 &q2,
const mpq3 &r2,
const mpq3 &n1,
const mpq3 &n2)
{
constexpr int dbg_level = 0;
if (dbg_level > 0) {
std::cout << "\ntri_tri_intersect_canon:\n";
std::cout << "p1=" << p1 << " q1=" << q1 << " r1=" << r1 << "\n";
std::cout << "p2=" << p2 << " q2=" << q2 << " r2=" << r2 << "\n";
std::cout << "n1=" << n1 << " n2=" << n2 << "\n";
std::cout << "approximate values:\n";
std::cout << "p1=(" << p1[0].get_d() << "," << p1[1].get_d() << "," << p1[2].get_d() << ")\n";
std::cout << "q1=(" << q1[0].get_d() << "," << q1[1].get_d() << "," << q1[2].get_d() << ")\n";
std::cout << "r1=(" << r1[0].get_d() << "," << r1[1].get_d() << "," << r1[2].get_d() << ")\n";
std::cout << "p2=(" << p2[0].get_d() << "," << p2[1].get_d() << "," << p2[2].get_d() << ")\n";
std::cout << "q2=(" << q2[0].get_d() << "," << q2[1].get_d() << "," << q2[2].get_d() << ")\n";
std::cout << "r2=(" << r2[0].get_d() << "," << r2[1].get_d() << "," << r2[2].get_d() << ")\n";
std::cout << "n1=(" << n1[0].get_d() << "," << n1[1].get_d() << "," << n1[2].get_d() << ")\n";
std::cout << "n2=(" << n2[0].get_d() << "," << n2[1].get_d() << "," << n2[2].get_d() << ")\n";
}
mpq3 p1p2 = p2 - p1;
mpq3 intersect_1;
mpq3 intersect_2;
bool no_overlap = false;
/* Top test in classification tree. */
if (tti_above(p1, q1, r2, p1p2) > 0) {
/* Middle right test in classification tree. */
if (tti_above(p1, r1, r2, p1p2) <= 0) {
/* Bottom right test in classification tree. */
if (tti_above(p1, r1, q2, p1p2) > 0) {
/* Overlap is [k [i l] j]. */
if (dbg_level > 0) {
std::cout << "overlap [k [i l] j]\n";
}
/* i is intersect with p1r1. l is intersect with p2r2. */
intersect_1 = tti_interp(p1, r1, p2, n2);
intersect_2 = tti_interp(p2, r2, p1, n1);
}
else {
/* Overlap is [i [k l] j]. */
if (dbg_level > 0) {
std::cout << "overlap [i [k l] j]\n";
}
/* k is intersect with p2q2. l is intersect is p2r2. */
intersect_1 = tti_interp(p2, q2, p1, n1);
intersect_2 = tti_interp(p2, r2, p1, n1);
}
}
else {
/* No overlap: [k l] [i j]. */
if (dbg_level > 0) {
std::cout << "no overlap: [k l] [i j]\n";
}
no_overlap = true;
}
}
else {
/* Middle left test in classification tree. */
if (tti_above(p1, q1, q2, p1p2) < 0) {
/* No overlap: [i j] [k l]. */
if (dbg_level > 0) {
std::cout << "no overlap: [i j] [k l]\n";
}
no_overlap = true;
}
else {
/* Bottom left test in classification tree. */
if (tti_above(p1, r1, q2, p1p2) >= 0) {
/* Overlap is [k [i j] l]. */
if (dbg_level > 0) {
std::cout << "overlap [k [i j] l]\n";
}
/* i is intersect with p1r1. j is intersect with p1q1. */
intersect_1 = tti_interp(p1, r1, p2, n2);
intersect_2 = tti_interp(p1, q1, p2, n2);
}
else {
/* Overlap is [i [k j] l]. */
if (dbg_level > 0) {
std::cout << "overlap [i [k j] l]\n";
}
/* k is intersect with p2q2. j is intersect with p1q1. */
intersect_1 = tti_interp(p2, q2, p1, n1);
intersect_2 = tti_interp(p1, q1, p2, n2);
}
}
}
if (no_overlap) {
return ITT_value(INONE);
}
if (intersect_1 == intersect_2) {
if (dbg_level > 0) {
std::cout << "single intersect: " << intersect_1 << "\n";
}
return ITT_value(IPOINT, intersect_1);
}
if (dbg_level > 0) {
std::cout << "intersect segment: " << intersect_1 << ", " << intersect_2 << "\n";
}
return ITT_value(ISEGMENT, intersect_1, intersect_2);
}
/* Helper function for intersect_tri_tri. Args have been canonicalized for triangle 1. */
static ITT_value itt_canon1(const mpq3 &p1,
const mpq3 &q1,
const mpq3 &r1,
const mpq3 &p2,
const mpq3 &q2,
const mpq3 &r2,
const mpq3 &n1,
const mpq3 &n2,
int sp2,
int sq2,
int sr2)
{
constexpr int dbg_level = 0;
if (sp2 > 0) {
if (sq2 > 0) {
return itt_canon2(p1, r1, q1, r2, p2, q2, n1, n2);
}
if (sr2 > 0) {
return itt_canon2(p1, r1, q1, q2, r2, p2, n1, n2);
}
return itt_canon2(p1, q1, r1, p2, q2, r2, n1, n2);
}
if (sp2 < 0) {
if (sq2 < 0) {
return itt_canon2(p1, q1, r1, r2, p2, q2, n1, n2);
}
if (sr2 < 0) {
return itt_canon2(p1, q1, r1, q2, r2, p2, n1, n2);
}
return itt_canon2(p1, r1, q1, p2, q2, r2, n1, n2);
}
if (sq2 < 0) {
if (sr2 >= 0) {
return itt_canon2(p1, r1, q1, q2, r2, p2, n1, n2);
}
return itt_canon2(p1, q1, r1, p2, q2, r2, n1, n2);
}
if (sq2 > 0) {
if (sr2 > 0) {
return itt_canon2(p1, r1, q1, p2, q2, r2, n1, n2);
}
return itt_canon2(p1, q1, r1, q2, r2, p2, n1, n2);
}
if (sr2 > 0) {
return itt_canon2(p1, q1, r1, r2, p2, q2, n1, n2);
}
if (sr2 < 0) {
return itt_canon2(p1, r1, q1, r2, p2, q2, n1, n2);
}
if (dbg_level > 0) {
std::cout << "triangles are co-planar\n";
}
return ITT_value(ICOPLANAR);
}
static ITT_value intersect_tri_tri(const IMesh &tm, int t1, int t2)
{
constexpr int dbg_level = 0;
# ifdef PERFDEBUG
incperfcount(1); /* Intersect_tri_tri calls. */
# endif
const Face &tri1 = *tm.face(t1);
const Face &tri2 = *tm.face(t2);
BLI_assert(tri1.plane_populated() && tri2.plane_populated());
const Vert *vp1 = tri1[0];
const Vert *vq1 = tri1[1];
const Vert *vr1 = tri1[2];
const Vert *vp2 = tri2[0];
const Vert *vq2 = tri2[1];
const Vert *vr2 = tri2[2];
if (dbg_level > 0) {
std::cout << "\nINTERSECT_TRI_TRI t1=" << t1 << ", t2=" << t2 << "\n";
std::cout << " p1 = " << vp1 << "\n";
std::cout << " q1 = " << vq1 << "\n";
std::cout << " r1 = " << vr1 << "\n";
std::cout << " p2 = " << vp2 << "\n";
std::cout << " q2 = " << vq2 << "\n";
std::cout << " r2 = " << vr2 << "\n";
}
/* Get signs of t1's vertices' distances to plane of t2 and vice versa. */
/* Try first getting signs with double arithmetic, with error bounds.
* If the signs calculated in this section are not 0, they are the same
* as what they would be using exact arithmetic. */
const double3 &d_p1 = vp1->co;
const double3 &d_q1 = vq1->co;
const double3 &d_r1 = vr1->co;
const double3 &d_p2 = vp2->co;
const double3 &d_q2 = vq2->co;
const double3 &d_r2 = vr2->co;
const double3 &d_n2 = tri2.plane->norm;
const double3 &abs_d_p1 = double3::abs(d_p1);
const double3 &abs_d_q1 = double3::abs(d_q1);
const double3 &abs_d_r1 = double3::abs(d_r1);
const double3 &abs_d_r2 = double3::abs(d_r2);
const double3 &abs_d_n2 = double3::abs(d_n2);
int sp1 = filter_plane_side(d_p1, d_r2, d_n2, abs_d_p1, abs_d_r2, abs_d_n2);
int sq1 = filter_plane_side(d_q1, d_r2, d_n2, abs_d_q1, abs_d_r2, abs_d_n2);
int sr1 = filter_plane_side(d_r1, d_r2, d_n2, abs_d_r1, abs_d_r2, abs_d_n2);
if ((sp1 > 0 && sq1 > 0 && sr1 > 0) || (sp1 < 0 && sq1 < 0 && sr1 < 0)) {
# ifdef PERFDEBUG
incperfcount(2); /* Tri tri intersects decided by filter plane tests. */
# endif
if (dbg_level > 0) {
std::cout << "no intersection, all t1's verts above or below t2\n";
}
return ITT_value(INONE);
}
const double3 &d_n1 = tri1.plane->norm;
const double3 &abs_d_p2 = double3::abs(d_p2);
const double3 &abs_d_q2 = double3::abs(d_q2);
const double3 &abs_d_n1 = double3::abs(d_n1);
int sp2 = filter_plane_side(d_p2, d_r1, d_n1, abs_d_p2, abs_d_r1, abs_d_n1);
int sq2 = filter_plane_side(d_q2, d_r1, d_n1, abs_d_q2, abs_d_r1, abs_d_n1);
int sr2 = filter_plane_side(d_r2, d_r1, d_n1, abs_d_r2, abs_d_r1, abs_d_n1);
if ((sp2 > 0 && sq2 > 0 && sr2 > 0) || (sp2 < 0 && sq2 < 0 && sr2 < 0)) {
# ifdef PERFDEBUG
incperfcount(2); /* Tri tri intersects decided by filter plane tests. */
# endif
if (dbg_level > 0) {
std::cout << "no intersection, all t2's verts above or below t1\n";
}
return ITT_value(INONE);
}
const mpq3 &p1 = vp1->co_exact;
const mpq3 &q1 = vq1->co_exact;
const mpq3 &r1 = vr1->co_exact;
const mpq3 &p2 = vp2->co_exact;
const mpq3 &q2 = vq2->co_exact;
const mpq3 &r2 = vr2->co_exact;
const mpq3 &n2 = tri2.plane->norm_exact;
if (sp1 == 0) {
sp1 = sgn(mpq3::dot(p1 - r2, n2));
}
if (sq1 == 0) {
sq1 = sgn(mpq3::dot(q1 - r2, n2));
}
if (sr1 == 0) {
sr1 = sgn(mpq3::dot(r1 - r2, n2));
}
if (dbg_level > 1) {
std::cout << " sp1=" << sp1 << " sq1=" << sq1 << " sr1=" << sr1 << "\n";
}
if ((sp1 * sq1 > 0) && (sp1 * sr1 > 0)) {
if (dbg_level > 0) {
std::cout << "no intersection, all t1's verts above or below t2 (exact)\n";
}
# ifdef PERFDEBUG
incperfcount(3); /* Tri tri intersects decided by exact plane tests. */
# endif
return ITT_value(INONE);
}
/* Repeat for signs of t2's vertices with respect to plane of t1. */
const mpq3 &n1 = tri1.plane->norm_exact;
if (sp2 == 0) {
sp2 = sgn(mpq3::dot(p2 - r1, n1));
}
if (sq2 == 0) {
sq2 = sgn(mpq3::dot(q2 - r1, n1));
}
if (sr2 == 0) {
sr2 = sgn(mpq3::dot(r2 - r1, n1));
}
if (dbg_level > 1) {
std::cout << " sp2=" << sp2 << " sq2=" << sq2 << " sr2=" << sr2 << "\n";
}
if ((sp2 * sq2 > 0) && (sp2 * sr2 > 0)) {
if (dbg_level > 0) {
std::cout << "no intersection, all t2's verts above or below t1 (exact)\n";
}
# ifdef PERFDEBUG
incperfcount(3); /* Tri tri intersects decided by exact plane tests. */
# endif
return ITT_value(INONE);
}
/* Do rest of the work with vertices in a canonical order, where p1 is on
* positive side of plane and q1, r1 are not, or p1 is on the plane and
* q1 and r1 are off the plane on the same side. */
ITT_value ans;
if (sp1 > 0) {
if (sq1 > 0) {
ans = itt_canon1(r1, p1, q1, p2, r2, q2, n1, n2, sp2, sr2, sq2);
}
else if (sr1 > 0) {
ans = itt_canon1(q1, r1, p1, p2, r2, q2, n1, n2, sp2, sr2, sq2);
}
else {
ans = itt_canon1(p1, q1, r1, p2, q2, r2, n1, n2, sp2, sq2, sr2);
}
}
else if (sp1 < 0) {
if (sq1 < 0) {
ans = itt_canon1(r1, p1, q1, p2, q2, r2, n1, n2, sp2, sq2, sr2);
}
else if (sr1 < 0) {
ans = itt_canon1(q1, r1, p1, p2, q2, r2, n1, n2, sp2, sq2, sr2);
}
else {
ans = itt_canon1(p1, q1, r1, p2, r2, q2, n1, n2, sp2, sr2, sq2);
}
}
else {
if (sq1 < 0) {
if (sr1 >= 0) {
ans = itt_canon1(q1, r1, p1, p2, r2, q2, n1, n2, sp2, sr2, sq2);
}
else {
ans = itt_canon1(p1, q1, r1, p2, q2, r2, n1, n2, sp2, sq2, sr2);
}
}
else if (sq1 > 0) {
if (sr1 > 0) {
ans = itt_canon1(p1, q1, r1, p2, r2, q2, n1, n2, sp2, sr2, sq2);
}
else {
ans = itt_canon1(q1, r1, p1, p2, q2, r2, n1, n2, sp2, sq2, sr2);
}
}
else {
if (sr1 > 0) {
ans = itt_canon1(r1, p1, q1, p2, q2, r2, n1, n2, sp2, sq2, sr2);
}
else if (sr1 < 0) {
ans = itt_canon1(r1, p1, q1, p2, r2, q2, n1, n2, sp2, sr2, sq2);
}
else {
if (dbg_level > 0) {
std::cout << "triangles are co-planar\n";
}
ans = ITT_value(ICOPLANAR);
}
}
}
if (ans.kind == ICOPLANAR) {
ans.t_source = t2;
}
# ifdef PERFDEBUG
if (ans.kind != INONE) {
incperfcount(4);
}
# endif
return ans;
}
struct CDT_data {
const Plane *t_plane;
Vector<mpq2> vert;
Vector<std::pair<int, int>> edge;
Vector<Vector<int>> face;
/** Parallels face, gives id from input #IMesh of input face. */
Vector<int> input_face;
/** Parallels face, says if input face orientation is opposite. */
Vector<bool> is_reversed;
/** Result of running CDT on input with (vert, edge, face). */
CDT_result<mpq_class> cdt_out;
int proj_axis;
};
/**
* We could de-duplicate verts here, but CDT routine will do that anyway.
*/
static int prepare_need_vert(CDT_data &cd, const mpq3 &p3d)
{
mpq2 p2d = project_3d_to_2d(p3d, cd.proj_axis);
int v = cd.vert.append_and_get_index(p2d);
return v;
}
/**
* To un-project a 2d vert that was projected along cd.proj_axis, we copy the coordinates
* from the two axes not involved in the projection, and use the plane equation of the
* originating 3d plane, cd.t_plane, to derive the coordinate of the projected axis.
* The plane equation says a point p is on the plane if dot(p, plane.n()) + plane.d() == 0.
* Assume that the projection axis is such that plane.n()[proj_axis] != 0.
*/
static mpq3 unproject_cdt_vert(const CDT_data &cd, const mpq2 &p2d)
{
mpq3 p3d;
BLI_assert(cd.t_plane->exact_populated());
BLI_assert(cd.t_plane->norm_exact[cd.proj_axis] != 0);
const mpq3 &n = cd.t_plane->norm_exact;
const mpq_class &d = cd.t_plane->d_exact;
switch (cd.proj_axis) {
case (0): {
mpq_class num = n[1] * p2d[0] + n[2] * p2d[1] + d;
num = -num;
p3d[0] = num / n[0];
p3d[1] = p2d[0];
p3d[2] = p2d[1];
break;
}
case (1): {
p3d[0] = p2d[0];
mpq_class num = n[0] * p2d[0] + n[2] * p2d[1] + d;
num = -num;
p3d[1] = num / n[1];
p3d[2] = p2d[1];
break;
}
case (2): {
p3d[0] = p2d[0];
p3d[1] = p2d[1];
mpq_class num = n[0] * p2d[0] + n[1] * p2d[1] + d;
num = -num;
p3d[2] = num / n[2];
break;
}
default:
BLI_assert(false);
}
return p3d;
}
static void prepare_need_edge(CDT_data &cd, const mpq3 &p1, const mpq3 &p2)
{
int v1 = prepare_need_vert(cd, p1);
int v2 = prepare_need_vert(cd, p2);
cd.edge.append(std::pair<int, int>(v1, v2));
}
static void prepare_need_tri(CDT_data &cd, const IMesh &tm, int t)
{
const Face &tri = *tm.face(t);
int v0 = prepare_need_vert(cd, tri[0]->co_exact);
int v1 = prepare_need_vert(cd, tri[1]->co_exact);
int v2 = prepare_need_vert(cd, tri[2]->co_exact);
bool rev;
/* How to get CCW orientation of projected triangle? Note that when look down y axis
* as opposed to x or z, the orientation of the other two axes is not right-and-up. */
BLI_assert(cd.t_plane->exact_populated());
if (tri.plane->norm_exact[cd.proj_axis] >= 0) {
rev = cd.proj_axis == 1;
}
else {
rev = cd.proj_axis != 1;
}
int cd_t = cd.face.append_and_get_index(Vector<int>());
cd.face[cd_t].append(v0);
if (rev) {
cd.face[cd_t].append(v2);
cd.face[cd_t].append(v1);
}
else {
cd.face[cd_t].append(v1);
cd.face[cd_t].append(v2);
}
cd.input_face.append(t);
cd.is_reversed.append(rev);
}
static CDT_data prepare_cdt_input(const IMesh &tm, int t, const Vector<ITT_value> itts)
{
CDT_data ans;
BLI_assert(tm.face(t)->plane_populated());
ans.t_plane = tm.face(t)->plane;
BLI_assert(ans.t_plane->exact_populated());
ans.proj_axis = mpq3::dominant_axis(ans.t_plane->norm_exact);
prepare_need_tri(ans, tm, t);
for (const ITT_value &itt : itts) {
switch (itt.kind) {
case INONE:
break;
case IPOINT: {
prepare_need_vert(ans, itt.p1);
break;
}
case ISEGMENT: {
prepare_need_edge(ans, itt.p1, itt.p2);
break;
}
case ICOPLANAR: {
prepare_need_tri(ans, tm, itt.t_source);
break;
}
}
}
return ans;
}
static CDT_data prepare_cdt_input_for_cluster(const IMesh &tm,
const CoplanarClusterInfo &clinfo,
int c,
const Vector<ITT_value> itts)
{
CDT_data ans;
BLI_assert(c < clinfo.tot_cluster());
const CoplanarCluster &cl = clinfo.cluster(c);
BLI_assert(cl.tot_tri() > 0);
int t0 = cl.tri(0);
BLI_assert(tm.face(t0)->plane_populated());
ans.t_plane = tm.face(t0)->plane;
BLI_assert(ans.t_plane->exact_populated());
ans.proj_axis = mpq3::dominant_axis(ans.t_plane->norm_exact);
for (const int t : cl) {
prepare_need_tri(ans, tm, t);
}
for (const ITT_value &itt : itts) {
switch (itt.kind) {
case IPOINT: {
prepare_need_vert(ans, itt.p1);
break;
}
case ISEGMENT: {
prepare_need_edge(ans, itt.p1, itt.p2);
break;
}
default:
break;
}
}
return ans;
}
/**
* Fills in cd.cdt_out with result of doing the cdt calculation on (vert, edge, face).
*/
static void do_cdt(CDT_data &cd)
{
constexpr int dbg_level = 0;
CDT_input<mpq_class> cdt_in;
cdt_in.vert = Span<mpq2>(cd.vert);
cdt_in.edge = Span<std::pair<int, int>>(cd.edge);
cdt_in.face = Span<Vector<int>>(cd.face);
if (dbg_level > 0) {
std::cout << "CDT input\nVerts:\n";
for (int i : cdt_in.vert.index_range()) {
std::cout << "v" << i << ": " << cdt_in.vert[i] << "=(" << cdt_in.vert[i][0].get_d() << ","
<< cdt_in.vert[i][1].get_d() << ")\n";
}
std::cout << "Edges:\n";
for (int i : cdt_in.edge.index_range()) {
std::cout << "e" << i << ": (" << cdt_in.edge[i].first << ", " << cdt_in.edge[i].second
<< ")\n";
}
std::cout << "Tris\n";
for (int f : cdt_in.face.index_range()) {
std::cout << "f" << f << ": ";
for (int j : cdt_in.face[f].index_range()) {
std::cout << cdt_in.face[f][j] << " ";
}
std::cout << "\n";
}
}
cdt_in.epsilon = 0; /* TODO: needs attention for non-exact T. */
cd.cdt_out = blender::meshintersect::delaunay_2d_calc(cdt_in, CDT_INSIDE);
if (dbg_level > 0) {
std::cout << "\nCDT result\nVerts:\n";
for (int i : cd.cdt_out.vert.index_range()) {
std::cout << "v" << i << ": " << cd.cdt_out.vert[i] << "=(" << cd.cdt_out.vert[i][0].get_d()
<< "," << cd.cdt_out.vert[i][1].get_d() << "\n";
}
std::cout << "Tris\n";
for (int f : cd.cdt_out.face.index_range()) {
std::cout << "f" << f << ": ";
for (int j : cd.cdt_out.face[f].index_range()) {
std::cout << cd.cdt_out.face[f][j] << " ";
}
std::cout << "orig: ";
for (int j : cd.cdt_out.face_orig[f].index_range()) {
std::cout << cd.cdt_out.face_orig[f][j] << " ";
}
std::cout << "\n";
}
std::cout << "Edges\n";
for (int e : cd.cdt_out.edge.index_range()) {
std::cout << "e" << e << ": (" << cd.cdt_out.edge[e].first << ", "
<< cd.cdt_out.edge[e].second << ") ";
std::cout << "orig: ";
for (int j : cd.cdt_out.edge_orig[e].index_range()) {
std::cout << cd.cdt_out.edge_orig[e][j] << " ";
}
std::cout << "\n";
}
}
}
static int get_cdt_edge_orig(
int i0, int i1, const CDT_data &cd, const IMesh &in_tm, bool *r_is_intersect)
{
int foff = cd.cdt_out.face_edge_offset;
*r_is_intersect = false;
for (int e : cd.cdt_out.edge.index_range()) {
std::pair<int, int> edge = cd.cdt_out.edge[e];
if ((edge.first == i0 && edge.second == i1) || (edge.first == i1 && edge.second == i0)) {
/* Pick an arbitrary orig, but not one equal to NO_INDEX, if we can help it. */
/* TODO: if edge has origs from more than on part of the nary input,
* then want to set *r_is_intersect to true. */
for (int orig_index : cd.cdt_out.edge_orig[e]) {
/* orig_index encodes the triangle and pos within the triangle of the input edge. */
if (orig_index >= foff) {
int in_face_index = (orig_index / foff) - 1;
int pos = orig_index % foff;
/* We need to retrieve the edge orig field from the Face used to populate the
* in_face_index'th face of the CDT, at the pos'th position of the face. */
int in_tm_face_index = cd.input_face[in_face_index];
BLI_assert(in_tm_face_index < in_tm.face_size());
const Face *facep = in_tm.face(in_tm_face_index);
BLI_assert(pos < facep->size());
bool is_rev = cd.is_reversed[in_face_index];
int eorig = is_rev ? facep->edge_orig[2 - pos] : facep->edge_orig[pos];
if (eorig != NO_INDEX) {
return eorig;
}
}
else {
/* This edge came from an edge input to the CDT problem,
* so it is an intersect edge. */
*r_is_intersect = true;
/* TODO: maybe there is an orig index:
* This happens if an input edge was formed by an input face having
* an edge that is co-planar with the cluster, while the face as a whole is not. */
return NO_INDEX;
}
}
return NO_INDEX;
}
}
return NO_INDEX;
}
/**
* Using the result of CDT in cd.cdt_out, extract an #IMesh representing the subdivision
* of input triangle t, which should be an element of cd.input_face.
*/
static IMesh extract_subdivided_tri(const CDT_data &cd,
const IMesh &in_tm,
int t,
IMeshArena *arena)
{
const CDT_result<mpq_class> &cdt_out = cd.cdt_out;
int t_in_cdt = -1;
for (int i = 0; i < cd.input_face.size(); ++i) {
if (cd.input_face[i] == t) {
t_in_cdt = i;
}
}
if (t_in_cdt == -1) {
std::cout << "Could not find " << t << " in cdt input tris\n";
BLI_assert(false);
return IMesh();
}
int t_orig = in_tm.face(t)->orig;
constexpr int inline_buf_size = 20;
Vector<Face *, inline_buf_size> faces;
for (int f : cdt_out.face.index_range()) {
if (cdt_out.face_orig[f].contains(t_in_cdt)) {
BLI_assert(cdt_out.face[f].size() == 3);
int i0 = cdt_out.face[f][0];
int i1 = cdt_out.face[f][1];
int i2 = cdt_out.face[f][2];
mpq3 v0co = unproject_cdt_vert(cd, cdt_out.vert[i0]);
mpq3 v1co = unproject_cdt_vert(cd, cdt_out.vert[i1]);
mpq3 v2co = unproject_cdt_vert(cd, cdt_out.vert[i2]);
/* No need to provide an original index: if coord matches
* an original one, then it will already be in the arena
* with the correct orig field. */
const Vert *v0 = arena->add_or_find_vert(v0co, NO_INDEX);
const Vert *v1 = arena->add_or_find_vert(v1co, NO_INDEX);
const Vert *v2 = arena->add_or_find_vert(v2co, NO_INDEX);
Face *facep;
bool is_isect0;
bool is_isect1;
bool is_isect2;
if (cd.is_reversed[t_in_cdt]) {
int oe0 = get_cdt_edge_orig(i0, i2, cd, in_tm, &is_isect0);
int oe1 = get_cdt_edge_orig(i2, i1, cd, in_tm, &is_isect1);
int oe2 = get_cdt_edge_orig(i1, i0, cd, in_tm, &is_isect2);
facep = arena->add_face(
{v0, v2, v1}, t_orig, {oe0, oe1, oe2}, {is_isect0, is_isect1, is_isect2});
}
else {
int oe0 = get_cdt_edge_orig(i0, i1, cd, in_tm, &is_isect0);
int oe1 = get_cdt_edge_orig(i1, i2, cd, in_tm, &is_isect1);
int oe2 = get_cdt_edge_orig(i2, i0, cd, in_tm, &is_isect2);
facep = arena->add_face(
{v0, v1, v2}, t_orig, {oe0, oe1, oe2}, {is_isect0, is_isect1, is_isect2});
}
facep->populate_plane(false);
faces.append(facep);
}
}
return IMesh(faces);
}
static IMesh extract_single_tri(const IMesh &tm, int t)
{
Face *f = tm.face(t);
return IMesh({f});
}
static bool bvhtreeverlap_cmp(const BVHTreeOverlap &a, const BVHTreeOverlap &b)
{
if (a.indexA < b.indexA) {
return true;
}
if ((a.indexA == b.indexA) & (a.indexB < b.indexB)) {
return true;
}
return false;
}
class TriOverlaps {
BVHTree *tree_{nullptr};
BVHTree *tree_b_{nullptr};
BVHTreeOverlap *overlap_{nullptr};
Array<int> first_overlap_;
uint overlap_tot_{0};
struct CBData {
const IMesh &tm;
std::function<int(int)> shape_fn;
int nshapes;
bool use_self;
};
public:
TriOverlaps(const IMesh &tm,
const Array<BoundingBox> &tri_bb,
int nshapes,
std::function<int(int)> shape_fn,
bool use_self)
{
constexpr int dbg_level = 0;
if (dbg_level > 0) {
std::cout << "TriOverlaps construction\n";
}
/* Tree type is 8 => octtree; axis = 6 => using XYZ axes only. */
tree_ = BLI_bvhtree_new(tm.face_size(), FLT_EPSILON, 8, 6);
/* In the common case of a binary boolean and no self intersection in
* each shape, we will use two trees and simple bounding box overlap. */
bool two_trees_no_self = nshapes == 2 && !use_self;
if (two_trees_no_self) {
tree_b_ = BLI_bvhtree_new(tm.face_size(), FLT_EPSILON, 8, 6);
}
float bbpts[6];
for (int t : tm.face_index_range()) {
const BoundingBox &bb = tri_bb[t];
copy_v3_v3(bbpts, bb.min);
copy_v3_v3(bbpts + 3, bb.max);
int shape = shape_fn(tm.face(t)->orig);
if (two_trees_no_self) {
if (shape == 0) {
BLI_bvhtree_insert(tree_, t, bbpts, 2);
}
else if (shape == 1) {
BLI_bvhtree_insert(tree_b_, t, bbpts, 2);
}
}
else {
if (shape != -1) {
BLI_bvhtree_insert(tree_, t, bbpts, 2);
}
}
}
BLI_bvhtree_balance(tree_);
if (two_trees_no_self) {
BLI_bvhtree_balance(tree_b_);
/* Don't expect a lot of trivial intersects in this case. */
overlap_ = BLI_bvhtree_overlap(tree_, tree_b_, &overlap_tot_, NULL, NULL);
}
else {
CBData cbdata{tm, shape_fn, nshapes, use_self};
if (nshapes == 1) {
overlap_ = BLI_bvhtree_overlap(tree_, tree_, &overlap_tot_, NULL, NULL);
}
else {
overlap_ = BLI_bvhtree_overlap(
tree_, tree_, &overlap_tot_, only_different_shapes, &cbdata);
}
}
/* The rest of the code is simpler and easier to parallelize if, in the two-trees case,
* we repeat the overlaps with indexA and indexB reversed. It is important that
* in the repeated part, sorting will then bring things with indexB together. */
if (two_trees_no_self) {
overlap_ = static_cast<BVHTreeOverlap *>(
MEM_reallocN(overlap_, 2 * overlap_tot_ * sizeof(overlap_[0])));
for (uint i = 0; i < overlap_tot_; ++i) {
overlap_[overlap_tot_ + i].indexA = overlap_[i].indexB;
overlap_[overlap_tot_ + i].indexB = overlap_[i].indexA;
}
overlap_tot_ += overlap_tot_;
}
/* Sort the overlaps to bring all the intersects with a given indexA together. */
std::sort(overlap_, overlap_ + overlap_tot_, bvhtreeverlap_cmp);
if (dbg_level > 0) {
std::cout << overlap_tot_ << " overlaps found:\n";
for (BVHTreeOverlap ov : overlap()) {
std::cout << "A: " << ov.indexA << ", B: " << ov.indexB << "\n";
}
}
first_overlap_ = Array<int>(tm.face_size(), -1);
for (int i = 0; i < static_cast<int>(overlap_tot_); ++i) {
int t = overlap_[i].indexA;
if (first_overlap_[t] == -1) {
first_overlap_[t] = i;
}
}
}
~TriOverlaps()
{
if (tree_) {
BLI_bvhtree_free(tree_);
}
if (tree_b_) {
BLI_bvhtree_free(tree_b_);
}
if (overlap_) {
MEM_freeN(overlap_);
}
}
Span<BVHTreeOverlap> overlap() const
{
return Span<BVHTreeOverlap>(overlap_, overlap_tot_);
}
int first_overlap_index(int t) const
{
return first_overlap_[t];
}
private:
static bool only_different_shapes(void *userdata, int index_a, int index_b, int UNUSED(thread))
{
CBData *cbdata = static_cast<CBData *>(userdata);
return cbdata->tm.face(index_a)->orig != cbdata->tm.face(index_b)->orig;
}
};
/**
* Data needed for parallelization of #calc_overlap_itts.
*/
struct OverlapIttsData {
Vector<std::pair<int, int>> intersect_pairs;
Map<std::pair<int, int>, ITT_value> &itt_map;
const IMesh &tm;
IMeshArena *arena;
OverlapIttsData(Map<std::pair<int, int>, ITT_value> &itt_map, const IMesh &tm, IMeshArena *arena)
: itt_map(itt_map), tm(tm), arena(arena)
{
}
};
/**
* Return a std::pair containing a and b in canonical order:
* With a <= b.
*/
static std::pair<int, int> canon_int_pair(int a, int b)
{
if (a > b) {
std::swap(a, b);
}
return std::pair<int, int>(a, b);
}
static void calc_overlap_itts_range_func(void *__restrict userdata,
const int iter,
const TaskParallelTLS *__restrict UNUSED(tls))
{
constexpr int dbg_level = 0;
OverlapIttsData *data = static_cast<OverlapIttsData *>(userdata);
std::pair<int, int> tri_pair = data->intersect_pairs[iter];
int a = tri_pair.first;
int b = tri_pair.second;
if (dbg_level > 0) {
std::cout << "calc_overlap_itts_range_func a=" << a << ", b=" << b << "\n";
}
ITT_value itt = intersect_tri_tri(data->tm, a, b);
if (dbg_level > 0) {
std::cout << "result of intersecting " << a << " and " << b << " = " << itt << "\n";
}
BLI_assert(data->itt_map.contains(tri_pair));
data->itt_map.add_overwrite(tri_pair, itt);
}
/**
* Fill in itt_map with the vector of ITT_values that result from intersecting the triangles in ov.
* Use a canonical order for triangles: (a,b) where a < b.
*/
static void calc_overlap_itts(Map<std::pair<int, int>, ITT_value> &itt_map,
const IMesh &tm,
const TriOverlaps &ov,
IMeshArena *arena)
{
OverlapIttsData data(itt_map, tm, arena);
/* Put dummy values in `itt_map` initially,
* so map entries will exist when doing the range function.
* This means we won't have to protect the `itt_map.add_overwrite` function with a lock. */
for (const BVHTreeOverlap &olap : ov.overlap()) {
std::pair<int, int> key = canon_int_pair(olap.indexA, olap.indexB);
if (!itt_map.contains(key)) {
itt_map.add_new(key, ITT_value());
data.intersect_pairs.append(key);
}
}
int tot_intersect_pairs = data.intersect_pairs.size();
TaskParallelSettings settings;
BLI_parallel_range_settings_defaults(&settings);
settings.min_iter_per_thread = 1000;
settings.use_threading = intersect_use_threading;
BLI_task_parallel_range(0, tot_intersect_pairs, &data, calc_overlap_itts_range_func, &settings);
}
/**
* Data needed for parallelization of calc_subdivided_tris.
*/
struct OverlapTriRange {
int tri_index;
int overlap_start;
int len;
};
struct SubdivideTrisData {
Array<IMesh> &r_tri_subdivided;
const IMesh &tm;
const Map<std::pair<int, int>, ITT_value> &itt_map;
Span<BVHTreeOverlap> overlap;
IMeshArena *arena;
/* This vector gives, for each triangle in tm that has an intersection
* we want to calculate: what the index of that triangle in tm is,
* where it starts in the ov structure as indexA, and how many
* overlap pairs have that same indexA (they will be continuous). */
Vector<OverlapTriRange> overlap_tri_range;
SubdivideTrisData(Array<IMesh> &r_tri_subdivided,
const IMesh &tm,
const Map<std::pair<int, int>, ITT_value> &itt_map,
Span<BVHTreeOverlap> overlap,
IMeshArena *arena)
: r_tri_subdivided(r_tri_subdivided),
tm(tm),
itt_map(itt_map),
overlap(overlap),
arena(arena),
overlap_tri_range{}
{
}
};
static void calc_subdivided_tri_range_func(void *__restrict userdata,
const int iter,
const TaskParallelTLS *__restrict UNUSED(tls))
{
constexpr int dbg_level = 0;
SubdivideTrisData *data = static_cast<SubdivideTrisData *>(userdata);
OverlapTriRange &otr = data->overlap_tri_range[iter];
int t = otr.tri_index;
if (dbg_level > 0) {
std::cout << "calc_subdivided_tri_range_func\nt=" << t << " start=" << otr.overlap_start
<< " len=" << otr.len << "\n";
}
constexpr int inline_capacity = 100;
Vector<ITT_value, inline_capacity> itts(otr.len);
for (int j = otr.overlap_start; j < otr.overlap_start + otr.len; ++j) {
int t_other = data->overlap[j].indexB;
std::pair<int, int> key = canon_int_pair(t, t_other);
ITT_value itt;
if (data->itt_map.contains(key)) {
itt = data->itt_map.lookup(key);
}
if (itt.kind != INONE) {
itts.append(itt);
}
if (dbg_level > 0) {
std::cout << " tri t" << t_other << "; result = " << itt << "\n";
}
}
if (itts.size() > 0) {
CDT_data cd_data = prepare_cdt_input(data->tm, t, itts);
do_cdt(cd_data);
data->r_tri_subdivided[t] = extract_subdivided_tri(cd_data, data->tm, t, data->arena);
if (dbg_level > 0) {
std::cout << "subdivide output\n" << data->r_tri_subdivided[t];
}
}
}
/**
* For each triangle in tm, fill in the corresponding slot in
* r_tri_subdivided with the result of intersecting it with
* all the other triangles in the mesh, if it intersects any others.
* But don't do this for triangles that are part of a cluster.
* Also, do nothing here if the answer is just the triangle itself.
*/
static void calc_subdivided_tris(Array<IMesh> &r_tri_subdivided,
const IMesh &tm,
const Map<std::pair<int, int>, ITT_value> &itt_map,
const CoplanarClusterInfo &clinfo,
const TriOverlaps &ov,
IMeshArena *arena)
{
const int dbg_level = 0;
if (dbg_level > 0) {
std::cout << "\nCALC_SUBDIVIDED_TRIS\n\n";
}
Span<BVHTreeOverlap> overlap = ov.overlap();
SubdivideTrisData data(r_tri_subdivided, tm, itt_map, overlap, arena);
int overlap_tot = overlap.size();
data.overlap_tri_range = Vector<OverlapTriRange>();
data.overlap_tri_range.reserve(overlap_tot);
int overlap_index = 0;
while (overlap_index < overlap_tot) {
int t = overlap[overlap_index].indexA;
int i = overlap_index;
while (i + 1 < overlap_tot && overlap[i + 1].indexA == t) {
++i;
}
/* Now overlap[overlap_index] to overlap[i] have indexA == t.
* We only record ranges for triangles that are not in clusters,
* because the ones in clusters are handled separately. */
if (clinfo.tri_cluster(t) == NO_INDEX) {
int len = i - overlap_index + 1;
if (!(len == 1 && overlap[overlap_index].indexB == t)) {
OverlapTriRange range = {t, overlap_index, len};
data.overlap_tri_range.append(range);
# ifdef PERFDEBUG
bumpperfcount(0, len); /* Non-cluster overlaps. */
# endif
}
}
overlap_index = i + 1;
}
int overlap_tri_range_tot = data.overlap_tri_range.size();
TaskParallelSettings settings;
BLI_parallel_range_settings_defaults(&settings);
settings.min_iter_per_thread = 50;
settings.use_threading = intersect_use_threading;
BLI_task_parallel_range(
0, overlap_tri_range_tot, &data, calc_subdivided_tri_range_func, &settings);
}
static CDT_data calc_cluster_subdivided(const CoplanarClusterInfo &clinfo,
int c,
const IMesh &tm,
const TriOverlaps &ov,
const Map<std::pair<int, int>, ITT_value> &itt_map,
IMeshArena *UNUSED(arena))
{
constexpr int dbg_level = 0;
BLI_assert(c < clinfo.tot_cluster());
const CoplanarCluster &cl = clinfo.cluster(c);
/* Make a CDT input with triangles from C and intersects from other triangles in tm. */
if (dbg_level > 0) {
std::cout << "CALC_CLUSTER_SUBDIVIDED for cluster " << c << " = " << cl << "\n";
}
/* Get vector itts of all intersections of a triangle of cl with any triangle of tm not
* in cl and not co-planar with it (for that latter, if there were an intersection,
* it should already be in cluster cl). */
Vector<ITT_value> itts;
Span<BVHTreeOverlap> ovspan = ov.overlap();
for (int t : cl) {
if (dbg_level > 0) {
std::cout << "find intersects with triangle " << t << " of cluster\n";
}
int first_i = ov.first_overlap_index(t);
if (first_i == -1) {
continue;
}
for (int i = first_i; i < ovspan.size() && ovspan[i].indexA == t; ++i) {
int t_other = ovspan[i].indexB;
if (clinfo.tri_cluster(t_other) != c) {
if (dbg_level > 0) {
std::cout << "use intersect(" << t << "," << t_other << "\n";
}
std::pair<int, int> key = canon_int_pair(t, t_other);
if (itt_map.contains(key)) {
ITT_value itt = itt_map.lookup(key);
if (itt.kind != INONE && itt.kind != ICOPLANAR) {
itts.append(itt);
if (dbg_level > 0) {
std::cout << " itt = " << itt << "\n";
}
}
}
}
}
}
/* Use CDT to subdivide the cluster triangles and the points and segs in itts. */
CDT_data cd_data = prepare_cdt_input_for_cluster(tm, clinfo, c, itts);
do_cdt(cd_data);
return cd_data;
}
static IMesh union_tri_subdivides(const blender::Array<IMesh> &tri_subdivided)
{
int tot_tri = 0;
for (const IMesh &m : tri_subdivided) {
tot_tri += m.face_size();
}
Array<Face *> faces(tot_tri);
int face_index = 0;
for (const IMesh &m : tri_subdivided) {
for (Face *f : m.faces()) {
faces[face_index++] = f;
}
}
return IMesh(faces);
}
static CoplanarClusterInfo find_clusters(const IMesh &tm,
const Array<BoundingBox> &tri_bb,
const Map<std::pair<int, int>, ITT_value> &itt_map)
{
constexpr int dbg_level = 0;
if (dbg_level > 0) {
std::cout << "FIND_CLUSTERS\n";
}
CoplanarClusterInfo ans(tm.face_size());
/* Use a VectorSet to get stable order from run to run. */
VectorSet<int> maybe_coplanar_tris;
maybe_coplanar_tris.reserve(2 * itt_map.size());
for (auto item : itt_map.items()) {
if (item.value.kind == ICOPLANAR) {
int t1 = item.key.first;
int t2 = item.key.second;
maybe_coplanar_tris.add_multiple({t1, t2});
}
}
if (dbg_level > 0) {
std::cout << "found " << maybe_coplanar_tris.size() << " possible coplanar tris\n";
}
if (maybe_coplanar_tris.size() == 0) {
if (dbg_level > 0) {
std::cout << "No possible coplanar tris, so no clusters\n";
}
return ans;
}
/* There can be more than one #CoplanarCluster per plane. Accumulate them in
* a Vector. We will have to merge some elements of the Vector as we discover
* triangles that form intersection bridges between two or more clusters. */
Map<Plane, Vector<CoplanarCluster>> plane_cls;
plane_cls.reserve(maybe_coplanar_tris.size());
for (int t : maybe_coplanar_tris) {
/* Use a canonical version of the plane for map index.
* We can't just store the canonical version in the face
* since canonicalizing loses the orientation of the normal. */
Plane tplane = *tm.face(t)->plane;
BLI_assert(tplane.exact_populated());
tplane.make_canonical();
if (dbg_level > 0) {
std::cout << "plane for tri " << t << " = " << &tplane << "\n";
}
/* Assume all planes are in canonical from (see canon_plane()). */
if (plane_cls.contains(tplane)) {
Vector<CoplanarCluster> &curcls = plane_cls.lookup(tplane);
if (dbg_level > 0) {
std::cout << "already has " << curcls.size() << " clusters\n";
}
/* Partition `curcls` into those that intersect t non-trivially, and those that don't. */
Vector<CoplanarCluster *> int_cls;
Vector<CoplanarCluster *> no_int_cls;
for (CoplanarCluster &cl : curcls) {
if (dbg_level > 1) {
std::cout << "consider intersecting with cluster " << cl << "\n";
}
if (bbs_might_intersect(tri_bb[t], cl.bounding_box())) {
if (dbg_level > 1) {
std::cout << "append to int_cls\n";
}
int_cls.append(&cl);
}
else {
if (dbg_level > 1) {
std::cout << "append to no_int_cls\n";
}
no_int_cls.append(&cl);
}
}
if (int_cls.size() == 0) {
/* t doesn't intersect any existing cluster in its plane, so make one just for it. */
if (dbg_level > 1) {
std::cout << "no intersecting clusters for t, make a new one\n";
}
curcls.append(CoplanarCluster(t, tri_bb[t]));
}
else if (int_cls.size() == 1) {
/* t intersects exactly one existing cluster, so can add t to that cluster. */
if (dbg_level > 1) {
std::cout << "exactly one existing cluster, " << int_cls[0] << ", adding to it\n";
}
int_cls[0]->add_tri(t, tri_bb[t]);
}
else {
/* t intersections 2 or more existing clusters: need to merge them and replace all the
* originals with the merged one in `curcls`. */
if (dbg_level > 1) {
std::cout << "merging\n";
}
CoplanarCluster mergecl;
mergecl.add_tri(t, tri_bb[t]);
for (CoplanarCluster *cl : int_cls) {
for (int t : *cl) {
mergecl.add_tri(t, tri_bb[t]);
}
}
Vector<CoplanarCluster> newvec;
newvec.append(mergecl);
for (CoplanarCluster *cl_no_int : no_int_cls) {
newvec.append(*cl_no_int);
}
plane_cls.add_overwrite(tplane, newvec);
}
}
else {
if (dbg_level > 0) {
std::cout << "first cluster for its plane\n";
}
plane_cls.add_new(tplane, Vector<CoplanarCluster>{CoplanarCluster(t, tri_bb[t])});
}
}
/* Does this give deterministic order for cluster ids? I think so, since
* hash for planes is on their values, not their addresses. */
for (auto item : plane_cls.items()) {
for (const CoplanarCluster &cl : item.value) {
if (cl.tot_tri() > 1) {
ans.add_cluster(cl);
}
}
}
return ans;
}
static bool face_is_degenerate(const Face *f)
{
const Face &face = *f;
const Vert *v0 = face[0];
const Vert *v1 = face[1];
const Vert *v2 = face[2];
if (v0 == v1 || v0 == v2 || v1 == v2) {
return true;
}
double3 da = v2->co - v0->co;
double3 db = v2->co - v1->co;
double3 dab = double3::cross_high_precision(da, db);
double dab_length_squared = dab.length_squared();
double err_bound = supremum_dot_cross(dab, dab) * index_dot_cross * DBL_EPSILON;
if (dab_length_squared > err_bound) {
return false;
}
mpq3 a = v2->co_exact - v0->co_exact;
mpq3 b = v2->co_exact - v1->co_exact;
mpq3 ab = mpq3::cross(a, b);
if (ab.x == 0 && ab.y == 0 && ab.z == 0) {
return true;
}
return false;
}
/* Data and functions to test triangle degeneracy in parallel. */
struct DegenData {
const IMesh &tm;
};
struct DegenChunkData {
bool has_degenerate_tri = false;
};
static void degenerate_range_func(void *__restrict userdata,
const int iter,
const TaskParallelTLS *__restrict tls)
{
DegenData *data = static_cast<DegenData *>(userdata);
DegenChunkData *chunk_data = static_cast<DegenChunkData *>(tls->userdata_chunk);
const Face *f = data->tm.face(iter);
bool is_degenerate = face_is_degenerate(f);
chunk_data->has_degenerate_tri |= is_degenerate;
}
static void degenerate_reduce(const void *__restrict UNUSED(userdata),
void *__restrict chunk_join,
void *__restrict chunk)
{
DegenChunkData *degen_chunk_join = static_cast<DegenChunkData *>(chunk_join);
DegenChunkData *degen_chunk = static_cast<DegenChunkData *>(chunk);
degen_chunk_join->has_degenerate_tri |= degen_chunk->has_degenerate_tri;
}
/* Does triangle #IMesh tm have any triangles with zero area? */
static bool has_degenerate_tris(const IMesh &tm)
{
DegenData degen_data = {tm};
DegenChunkData degen_chunk_data;
TaskParallelSettings settings;
BLI_parallel_range_settings_defaults(&settings);
settings.userdata_chunk = °en_chunk_data;
settings.userdata_chunk_size = sizeof(degen_chunk_data);
settings.func_reduce = degenerate_reduce;
settings.min_iter_per_thread = 1000;
settings.use_threading = intersect_use_threading;
BLI_task_parallel_range(0, tm.face_size(), °en_data, degenerate_range_func, &settings);
return degen_chunk_data.has_degenerate_tri;
}
static IMesh remove_degenerate_tris(const IMesh &tm_in)
{
IMesh ans;
Vector<Face *> new_faces;
new_faces.reserve(tm_in.face_size());
for (Face *f : tm_in.faces()) {
if (!face_is_degenerate(f)) {
new_faces.append(f);
}
}
ans.set_faces(new_faces);
return ans;
}
/* This is the main routine for calculating the self_intersection of a triangle mesh. */
IMesh trimesh_self_intersect(const IMesh &tm_in, IMeshArena *arena)
{
return trimesh_nary_intersect(
tm_in, 1, [](int UNUSED(t)) { return 0; }, true, arena);
}
IMesh trimesh_nary_intersect(const IMesh &tm_in,
int nshapes,
std::function<int(int)> shape_fn,
bool use_self,
IMeshArena *arena)
{
constexpr int dbg_level = 0;
if (dbg_level > 0) {
std::cout << "\nTRIMESH_NARY_INTERSECT nshapes=" << nshapes << " use_self=" << use_self
<< "\n";
for (const Face *f : tm_in.faces()) {
BLI_assert(f->is_tri());
UNUSED_VARS_NDEBUG(f);
}
if (dbg_level > 1) {
std::cout << "input mesh:\n" << tm_in;
for (int t : tm_in.face_index_range()) {
std::cout << "shape(" << t << ") = " << shape_fn(tm_in.face(t)->orig) << "\n";
}
write_obj_mesh(const_cast<IMesh &>(tm_in), "trimesh_input");
}
}
# ifdef PERFDEBUG
perfdata_init();
double start_time = PIL_check_seconds_timer();
std::cout << "trimesh_nary_intersect start\n";
# endif
/* Usually can use tm_in but if it has degenerate or illegal triangles,
* then need to work on a copy of it without those triangles. */
const IMesh *tm_clean = &tm_in;
IMesh tm_cleaned;
if (has_degenerate_tris(tm_in)) {
if (dbg_level > 0) {
std::cout << "cleaning degenerate triangles\n";
}
tm_cleaned = remove_degenerate_tris(tm_in);
tm_clean = &tm_cleaned;
if (dbg_level > 1) {
std::cout << "cleaned input mesh:\n" << tm_cleaned;
}
}
# ifdef PERFDEBUG
double clean_time = PIL_check_seconds_timer();
std::cout << "cleaned, time = " << clean_time - start_time << "\n";
# endif
Array<BoundingBox> tri_bb = calc_face_bounding_boxes(*tm_clean);
# ifdef PERFDEBUG
double bb_calc_time = PIL_check_seconds_timer();
std::cout << "bbs calculated, time = " << bb_calc_time - clean_time << "\n";
# endif
TriOverlaps tri_ov(*tm_clean, tri_bb, nshapes, shape_fn, use_self);
# ifdef PERFDEBUG
double overlap_time = PIL_check_seconds_timer();
std::cout << "intersect overlaps calculated, time = " << overlap_time - bb_calc_time << "\n";
# endif
for (int t : tm_clean->face_index_range()) {
if (tri_ov.first_overlap_index(t) != -1) {
tm_clean->face(t)->populate_plane(true);
}
}
# ifdef PERFDEBUG
double plane_populate = PIL_check_seconds_timer();
std::cout << "planes populated, time = " << plane_populate - overlap_time << "\n";
# endif
/* itt_map((a,b)) will hold the intersection value resulting from intersecting
* triangles with indices a and b, where a < b. */
Map<std::pair<int, int>, ITT_value> itt_map;
itt_map.reserve(tri_ov.overlap().size());
calc_overlap_itts(itt_map, *tm_clean, tri_ov, arena);
# ifdef PERFDEBUG
double itt_time = PIL_check_seconds_timer();
std::cout << "itts found, time = " << itt_time - plane_populate << "\n";
# endif
CoplanarClusterInfo clinfo = find_clusters(*tm_clean, tri_bb, itt_map);
if (dbg_level > 1) {
std::cout << clinfo;
}
# ifdef PERFDEBUG
double find_cluster_time = PIL_check_seconds_timer();
std::cout << "clusters found, time = " << find_cluster_time - itt_time << "\n";
doperfmax(0, tm_in.face_size());
doperfmax(1, clinfo.tot_cluster());
doperfmax(2, tri_ov.overlap().size());
# endif
Array<IMesh> tri_subdivided(tm_clean->face_size());
calc_subdivided_tris(tri_subdivided, *tm_clean, itt_map, clinfo, tri_ov, arena);
# ifdef PERFDEBUG
double subdivided_tris_time = PIL_check_seconds_timer();
std::cout << "subdivided tris found, time = " << subdivided_tris_time - itt_time << "\n";
# endif
Array<CDT_data> cluster_subdivided(clinfo.tot_cluster());
for (int c : clinfo.index_range()) {
cluster_subdivided[c] = calc_cluster_subdivided(clinfo, c, *tm_clean, tri_ov, itt_map, arena);
}
# ifdef PERFDEBUG
double cluster_subdivide_time = PIL_check_seconds_timer();
std::cout << "subdivided clusters found, time = "
<< cluster_subdivide_time - subdivided_tris_time << "\n";
# endif
for (int t : tm_clean->face_index_range()) {
int c = clinfo.tri_cluster(t);
if (c != NO_INDEX) {
BLI_assert(tri_subdivided[t].face_size() == 0);
tri_subdivided[t] = extract_subdivided_tri(cluster_subdivided[c], *tm_clean, t, arena);
}
else if (tri_subdivided[t].face_size() == 0) {
tri_subdivided[t] = extract_single_tri(*tm_clean, t);
}
}
# ifdef PERFDEBUG
double extract_time = PIL_check_seconds_timer();
std::cout << "triangles extracted, time = " << extract_time - cluster_subdivide_time << "\n";
# endif
IMesh combined = union_tri_subdivides(tri_subdivided);
if (dbg_level > 1) {
std::cout << "TRIMESH_NARY_INTERSECT answer:\n";
std::cout << combined;
}
# ifdef PERFDEBUG
double end_time = PIL_check_seconds_timer();
std::cout << "triangles combined, time = " << end_time - extract_time << "\n";
std::cout << "trimesh_nary_intersect done, total time = " << end_time - start_time << "\n";
dump_perfdata();
# endif
return combined;
}
static std::ostream &operator<<(std::ostream &os, const CoplanarCluster &cl)
{
os << "cl(";
bool first = true;
for (const int t : cl) {
if (first) {
first = false;
}
else {
os << ",";
}
os << t;
}
os << ")";
return os;
}
static std::ostream &operator<<(std::ostream &os, const CoplanarClusterInfo &clinfo)
{
os << "Coplanar Cluster Info:\n";
for (int c : clinfo.index_range()) {
os << c << ": " << clinfo.cluster(c) << "\n";
}
return os;
}
static std::ostream &operator<<(std::ostream &os, const ITT_value &itt)
{
switch (itt.kind) {
case INONE:
os << "none";
break;
case IPOINT:
os << "point " << itt.p1;
break;
case ISEGMENT:
os << "segment " << itt.p1 << " " << itt.p2;
break;
case ICOPLANAR:
os << "co-planar t" << itt.t_source;
break;
}
return os;
}
/**
* Writing the obj_mesh has the side effect of populating verts.
*/
void write_obj_mesh(IMesh &m, const std::string &objname)
{
/* Would like to use #BKE_tempdir_base() here, but that brings in dependence on kernel library.
* This is just for developer debugging anyway,
* and should never be called in production Blender. */
# ifdef _WIN_32
const char *objdir = BLI_getenv("HOME");
# else
const char *objdir = "/tmp/";
# endif
if (m.face_size() == 0) {
return;
}
std::string fname = std::string(objdir) + objname + std::string(".obj");
std::ofstream f;
f.open(fname);
if (!f) {
std::cout << "Could not open file " << fname << "\n";
return;
}
if (!m.has_verts()) {
m.populate_vert();
}
for (const Vert *v : m.vertices()) {
const double3 dv = v->co;
f << "v " << dv[0] << " " << dv[1] << " " << dv[2] << "\n";
}
int i = 0;
for (const Face *face : m.faces()) {
/* OBJ files use 1-indexing for vertices. */
f << "f ";
for (const Vert *v : *face) {
int i = m.lookup_vert(v);
BLI_assert(i != NO_INDEX);
/* OBJ files use 1-indexing for vertices. */
f << i + 1 << " ";
}
f << "\n";
++i;
}
f.close();
}
# ifdef PERFDEBUG
struct PerfCounts {
Vector<int> count;
Vector<const char *> count_name;
Vector<int> max;
Vector<const char *> max_name;
};
static PerfCounts *perfdata = nullptr;
static void perfdata_init(void)
{
perfdata = new PerfCounts;
/* count 0. */
perfdata->count.append(0);
perfdata->count_name.append("Non-cluster overlaps");
/* count 1. */
perfdata->count.append(0);
perfdata->count_name.append("intersect_tri_tri calls");
/* count 2. */
perfdata->count.append(0);
perfdata->count_name.append("tri tri intersects decided by filter plane tests");
/* count 3. */
perfdata->count.append(0);
perfdata->count_name.append("tri tri intersects decided by exact plane tests");
/* count 4. */
perfdata->count.append(0);
perfdata->count_name.append("final non-NONE intersects");
/* max 0. */
perfdata->max.append(0);
perfdata->max_name.append("total faces");
/* max 1. */
perfdata->max.append(0);
perfdata->max_name.append("total clusters");
/* max 2. */
perfdata->max.append(0);
perfdata->max_name.append("total overlaps");
}
static void incperfcount(int countnum)
{
perfdata->count[countnum]++;
}
static void bumpperfcount(int countnum, int amt)
{
perfdata->count[countnum] += amt;
}
static void doperfmax(int maxnum, int val)
{
perfdata->max[maxnum] = max_ii(perfdata->max[maxnum], val);
}
static void dump_perfdata(void)
{
std::cout << "\nPERFDATA\n";
for (int i : perfdata->count.index_range()) {
std::cout << perfdata->count_name[i] << " = " << perfdata->count[i] << "\n";
}
for (int i : perfdata->max.index_range()) {
std::cout << perfdata->max_name[i] << " = " << perfdata->max[i] << "\n";
}
delete perfdata;
}
# endif
} // namespace blender::meshintersect
#endif // WITH_GMP
|