Mercurial > hg > orthanc-stone

comparison OrthancStone/Resources/Graveyard/RTStructTentativeReimplementation-BGO/TestStructureSet.cpp @ 1908:affde38b84de

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
moved tentative bgo reimplementation of rt-struct into graveyard
author Sebastien Jodogne <s.jodogne@gmail.com>
date Tue, 01 Feb 2022 08:38:32 +0100
parents
children
comparison
equal deleted inserted replaced
1907:0208f99b8bde 1908:affde38b84de
1
2 #define BGO_ENABLE_DICOMSTRUCTURESETLOADER2
3
4 // working around a bug where the Visual C++ compiler would get
5 // stuck trying to compile this cpp file in release mode
6 // (versions: https://en.wikipedia.org/wiki/Microsoft_Visual_C%2B%2B)
7 #ifdef _MSC_VER
8 # pragma optimize("", off)
9 // warning C4748: /GS can not protect parameters and local variables from
10 // local buffer overrun because optimizations are disabled in function
11 # pragma warning(disable: 4748)
12 #endif
13
14
15
16 #include <boost/date_time/posix_time/posix_time.hpp>
17 #include <boost/make_shared.hpp>
18 #include <string>
19
20
21
22 using namespace OrthancStone;
23
24 static const double DELTA_MAX = 10.0 * std::numeric_limits<float>::epsilon();
25
26
27
28 #define STONE_ARRAY_SIZE(arr) (sizeof(arr) / sizeof((arr)[0]))
29
30 static double pointsCoord1[] = { 2, 2, 3, 3, 6, 8, 8, 7, 8, 8, 6 };
31 static double pointsCoord2[] = { 2, 6, 8, 10, 12, 10, 8, 6, 4, 2, 4 };
32 static const size_t pointsCoord1Count = STONE_ARRAY_SIZE(pointsCoord1);
33 static const size_t pointsCoord2Count = STONE_ARRAY_SIZE(pointsCoord2);
34 const size_t POLYGON_POINT_COUNT = pointsCoord1Count;
35
36
37 #ifdef BGO_ENABLE_DICOMSTRUCTURESETLOADER2
38
39 static void CheckGroundTruth(
40 const std::vector<DicomStructure2>& structures,
41 const size_t structureIndex,
42 const size_t sliceIndex,
43 std::vector<double> groundTruth)
44 {
45 const std::vector<DicomStructurePolygon2>& polygonsForThisStruct = structures.at(structureIndex).GetPolygons();
46 const DicomStructurePolygon2& polygon = polygonsForThisStruct.at(sliceIndex);
47
48 //double groundTruth[] = { 7.657838, 108.2725, 304.01, 6.826687, 107.4413, 304.01, 6.152492, 106.4785, 304.01, 5.655735, 105.4132, 304.01, 5.351513, 104.2778, 304.01, 5.249068, 103.1069, 304.01, 5.351513, 101.9359, 304.01, 5.655735, 100.8005, 304.01, 6.152492, 99.73524, 304.01, 6.826687, 98.77239, 304.01, 7.657838, 97.94124, 304.01, 8.620689, 97.26704, 304.01, 9.685987, 96.77029, 304.01, 10.82136, 96.46606, 304.01, 11.99231, 96.36362, 304.01, 13.16326, 96.46606, 304.01, 14.29864, 96.77029, 304.01, 15.36393, 97.26704, 304.01, 16.32678, 97.94124, 304.01, 17.15794, 98.77239, 304.01, 17.83213, 99.73524, 304.01, 18.32889, 100.8005, 304.01, 18.63311, 101.9359, 304.01, 18.73555, 103.1069, 304.01, 18.63311, 104.2778, 304.01, 18.32889, 105.4132, 304.01, 17.83213, 106.4785, 304.01, 17.15794, 107.4413, 304.01, 16.32678, 108.2725, 304.01, 15.36393, 108.9467, 304.01, 14.29864, 109.4434, 304.01, 13.16326, 109.7477, 304.01, 11.99231, 109.8501, 304.01, 10.82136, 109.7477, 304.01, 9.685987, 109.4434, 304.01, 8.620689, 108.9467, 304.01 };
49 size_t groundTruthItems = groundTruth.size();
50
51 size_t pointCount = 3 * polygon.GetPointCount();
52
53 EXPECT_EQ(groundTruthItems, pointCount);
54
55 for (size_t i = 0; i < polygon.GetPointCount(); ++i)
56 {
57 const Vector& point = polygon.GetPoint(i);
58
59 // loop over X, Y then Z.
60 for (size_t j = 0; j < 3; ++j)
61 {
62 size_t index = 3 * i + j;
63 ASSERT_LT(index, groundTruthItems);
64 bool isNear = LinearAlgebra::IsNear(groundTruth[index], point[j]);
65 EXPECT_TRUE(isNear);
66 }
67 }
68 }
69
70
71 #include <Toolbox.h>
72
73 TEST(StructureSet2, ReadFromJsonThatsAll)
74 {
75 /*
76 The "RT_STRUCT_00" string is the reply to the following Orthanc request:
77
78 http://localhost:8042/instances/1aa5f84b-c32a03b4-3c1857da-da2e69f3-3ef6e2b3/tags?ignore-length=3006-0050
79
80 The tag hierarchy can be found here: https://dicom.innolitics.com/ciods/rt-dose
81 */
82
83 DicomStructureSet2 structureSet;
84
85 FullOrthancDataset dicom(Orthanc::EmbeddedResources::GetFileResourceBuffer(Orthanc::EmbeddedResources::RT_STRUCT_00),
86 Orthanc::EmbeddedResources::GetFileResourceSize(Orthanc::EmbeddedResources::RT_STRUCT_00));
87 structureSet.Clear();
88
89 structureSet.FillStructuresFromDataset(dicom);
90 structureSet.ComputeDependentProperties();
91
92 const std::vector<DicomStructure2>& structures = structureSet.structures_;
93
94 /*
95
96 ██████╗ █████╗ ███████╗██╗ ██████╗ ██████╗██╗ ██╗███████╗ ██████╗██╗ ██╗███████╗
97 ██╔══██╗██╔══██╗██╔════╝██║██╔════╝ ██╔════╝██║ ██║██╔════╝██╔════╝██║ ██╔╝██╔════╝
98 ██████╔╝███████║███████╗██║██║ ██║ ███████║█████╗ ██║ █████╔╝ ███████╗
99 ██╔══██╗██╔══██║╚════██║██║██║ ██║ ██╔══██║██╔══╝ ██║ ██╔═██╗ ╚════██║
100 ██████╔╝██║ ██║███████║██║╚██████╗ ╚██████╗██║ ██║███████╗╚██████╗██║ ██╗███████║
101 ╚═════╝ ╚═╝ ╚═╝╚══════╝╚═╝ ╚═════╝ ╚═════╝╚═╝ ╚═╝╚══════╝ ╚═════╝╚═╝ ╚═╝╚══════╝
102 http://patorjk.com/software/taag/#p=display&f=ANSI%20Shadow&t=BASIC%20CHECKS
103 */
104
105 // (0x3006, 0x0080) seq. size
106 EXPECT_EQ(7u, structures.size());
107
108 // (0x3006, 0x0080)[i]/(0x3006, 0x00a4)
109 for (size_t i = 0; i < 5; ++i)
110 {
111 EXPECT_EQ(std::string("ORGAN"), structures[i].interpretation_);
112 }
113 EXPECT_EQ(std::string("EXTERNAL"), structures[5].interpretation_);
114 EXPECT_EQ(std::string("PTV"), structures[6].interpretation_);
115
116 // (0x3006, 0x0020)[i]/(0x3006, 0x0026)
117 EXPECT_EQ(std::string("LN300"), structures[0].name_);
118 EXPECT_EQ(std::string("Cortical Bone"), structures[1].name_);
119 EXPECT_EQ(std::string("Adipose"), structures[2].name_);
120 EXPECT_EQ(std::string("CB2-50%"), structures[3].name_);
121 EXPECT_EQ(std::string("Water"), structures[4].name_);
122 EXPECT_EQ(std::string("External"), structures[5].name_);
123 EXPECT_EQ(std::string("PTV"), structures[6].name_);
124
125 // (0x3006, 0x0039)[i]/(0x3006, 0x002a)
126 EXPECT_EQ(0xff, structures[0].red_);
127 EXPECT_EQ(0x00, structures[0].green_);
128 EXPECT_EQ(0x00, structures[0].blue_);
129
130 EXPECT_EQ(0x00, structures[1].red_);
131 EXPECT_EQ(0xff, structures[1].green_);
132 EXPECT_EQ(0xff, structures[1].blue_);
133
134 // ...
135
136 EXPECT_EQ(0x00, structures[5].red_);
137 EXPECT_EQ(0x80, structures[5].green_);
138 EXPECT_EQ(0x00, structures[5].blue_);
139
140 EXPECT_EQ(0xff, structures[6].red_);
141 EXPECT_EQ(0x00, structures[6].green_);
142 EXPECT_EQ(0xff, structures[6].blue_);
143
144 /*
145
146 ██████╗ ███████╗ ██████╗ ███╗ ███╗███████╗████████╗██████╗ ██╗ ██╗
147 ██╔════╝ ██╔════╝██╔═══██╗████╗ ████║██╔════╝╚══██╔══╝██╔══██╗╚██╗ ██╔╝
148 ██║ ███╗█████╗ ██║ ██║██╔████╔██║█████╗ ██║ ██████╔╝ ╚████╔╝
149 ██║ ██║██╔══╝ ██║ ██║██║╚██╔╝██║██╔══╝ ██║ ██╔══██╗ ╚██╔╝
150 ╚██████╔╝███████╗╚██████╔╝██║ ╚═╝ ██║███████╗ ██║ ██║ ██║ ██║
151 ╚═════╝ ╚══════╝ ╚═════╝ ╚═╝ ╚═╝╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝
152 http://patorjk.com/software/taag/#p=display&f=ANSI%20Shadow&t=BASIC%20CHECKS
153 */
154
155
156 {
157 double groundTruthRaw[] = { 7.657838, 108.2725, 304.01, 6.826687, 107.4413, 304.01, 6.152492, 106.4785, 304.01, 5.655735, 105.4132, 304.01, 5.351513, 104.2778, 304.01, 5.249068, 103.1069, 304.01, 5.351513, 101.9359, 304.01, 5.655735, 100.8005, 304.01, 6.152492, 99.73524, 304.01, 6.826687, 98.77239, 304.01, 7.657838, 97.94124, 304.01, 8.620689, 97.26704, 304.01, 9.685987, 96.77029, 304.01, 10.82136, 96.46606, 304.01, 11.99231, 96.36362, 304.01, 13.16326, 96.46606, 304.01, 14.29864, 96.77029, 304.01, 15.36393, 97.26704, 304.01, 16.32678, 97.94124, 304.01, 17.15794, 98.77239, 304.01, 17.83213, 99.73524, 304.01, 18.32889, 100.8005, 304.01, 18.63311, 101.9359, 304.01, 18.73555, 103.1069, 304.01, 18.63311, 104.2778, 304.01, 18.32889, 105.4132, 304.01, 17.83213, 106.4785, 304.01, 17.15794, 107.4413, 304.01, 16.32678, 108.2725, 304.01, 15.36393, 108.9467, 304.01, 14.29864, 109.4434, 304.01, 13.16326, 109.7477, 304.01, 11.99231, 109.8501, 304.01, 10.82136, 109.7477, 304.01, 9.685987, 109.4434, 304.01, 8.620689, 108.9467, 304.01 };
158 size_t n = sizeof(groundTruthRaw) / sizeof(groundTruthRaw[0]);
159 std::vector<double> groundTruth(groundTruthRaw, groundTruthRaw+n);
160 CheckGroundTruth(structures, 0, 0, groundTruth);
161 }
162 {
163 double groundTruthRaw[] = { 7.657838, 108.2725, 310.01, 6.826687, 107.4413, 310.01, 6.152492, 106.4785, 310.01, 5.655735, 105.4132, 310.01, 5.351513, 104.2778, 310.01, 5.249068, 103.1069, 310.01, 5.351513, 101.9359, 310.01, 5.655735, 100.8005, 310.01, 6.152492, 99.73524, 310.01, 6.826687, 98.77239, 310.01, 7.657838, 97.94124, 310.01, 8.620689, 97.26704, 310.01, 9.685987, 96.77029, 310.01, 10.82136, 96.46606, 310.01, 11.99231, 96.36362, 310.01, 13.16326, 96.46606, 310.01, 14.29864, 96.77029, 310.01, 15.36393, 97.26704, 310.01, 16.32678, 97.94124, 310.01, 17.15794, 98.77239, 310.01, 17.83213, 99.73524, 310.01, 18.32889, 100.8005, 310.01, 18.63311, 101.9359, 310.01, 18.73555, 103.1069, 310.01, 18.63311, 104.2778, 310.01, 18.32889, 105.4132, 310.01, 17.83213, 106.4785, 310.01, 17.15794, 107.4413, 310.01, 16.32678, 108.2725, 310.01, 15.36393, 108.9467, 310.01, 14.29864, 109.4434, 310.01, 13.16326, 109.7477, 310.01, 11.99231, 109.8501, 310.01, 10.82136, 109.7477, 310.01, 9.685987, 109.4434, 310.01, 8.620689, 108.9467, 310.01 };
164 size_t n = sizeof(groundTruthRaw) / sizeof(groundTruthRaw[0]);
165 std::vector<double> groundTruth(groundTruthRaw, groundTruthRaw+n);
166 CheckGroundTruth(structures, 0, 2, groundTruth);
167 }
168 {
169 double groundTruthRaw[] = { -37.967, 161.9664, 304.01, -39.10237, 161.6622, 304.01, -40.16767, 161.1655, 304.01, -41.13052, 160.4913, 304.01, -41.96167, 159.6601, 304.01, -42.63587, 158.6973, 304.01, -43.13263, 157.632, 304.01, -43.43685, 156.4966, 304.01, -43.53929, 155.3257, 304.01, -43.43685, 154.1547, 304.01, -43.13263, 153.0193, 304.01, -42.63587, 151.954, 304.01, -41.96167, 150.9912, 304.01, -41.13052, 150.16, 304.01, -40.16767, 149.4858, 304.01, -39.10237, 148.9891, 304.01, -37.967, 148.6849, 304.01, -36.79605, 148.5824, 304.01, -35.6251, 148.6849, 304.01, -34.48972, 148.9891, 304.01, -33.42443, 149.4858, 304.01, -32.46157, 150.16, 304.01, -31.63042, 150.9912, 304.01, -30.95623, 151.954, 304.01, -30.45947, 153.0193, 304.01, -30.15525, 154.1547, 304.01, -30.0528, 155.3257, 304.01, -30.15525, 156.4966, 304.01, -30.45947, 157.632, 304.01, -30.95623, 158.6973, 304.01, -31.63042, 159.6601, 304.01, -32.46157, 160.4913, 304.01, -33.42443, 161.1655, 304.01, -34.48972, 161.6622, 304.01, -35.6251, 161.9664, 304.01, -36.79605, 162.0689, 304.01 };
170 size_t n = sizeof(groundTruthRaw) / sizeof(groundTruthRaw[0]);
171 std::vector<double> groundTruth(groundTruthRaw, groundTruthRaw+n);
172 CheckGroundTruth(structures, 1, 0, groundTruth);
173 }
174 {
175 double groundTruthRaw[] = { 69.4042, 150.7324, 307.01, 69.70842, 151.8678, 307.01, 69.81087, 153.0387, 307.01, 69.70842, 154.2097, 307.01, 69.4042, 155.345, 307.01, 68.90745, 156.4103, 307.01, 68.23325, 157.3732, 307.01, 67.4021, 158.2043, 307.01, 66.43925, 158.8785, 307.01, 65.37395, 159.3753, 307.01, 64.23858, 159.6795, 307.01, 63.06762, 159.7819, 307.01, 61.89667, 159.6795, 307.01, 60.7613, 159.3753, 307.01, 59.696, 158.8785, 307.01, 58.73315, 158.2043, 307.01, 57.902, 157.3732, 307.01, 57.22781, 156.4103, 307.01, 56.73105, 155.345, 307.01, 56.42683, 154.2097, 307.01, 56.32438, 153.0387, 307.01, 56.42683, 151.8678, 307.01, 56.73105, 150.7324, 307.01, 57.22781, 149.6671, 307.01, 57.902, 148.7042, 307.01, 58.73315, 147.8731, 307.01, 59.696, 147.1989, 307.01, 60.7613, 146.7021, 307.01, 61.89667, 146.3979, 307.01, 63.06762, 146.2955, 307.01, 64.23858, 146.3979, 307.01, 65.37395, 146.7021, 307.01, 66.43925, 147.1989, 307.01, 67.4021, 147.8731, 307.01, 68.23325, 148.7042, 307.01, 68.90745, 149.6671, 307.01 };
176 size_t n = sizeof(groundTruthRaw) / sizeof(groundTruthRaw[0]);
177 std::vector<double> groundTruth(groundTruthRaw, groundTruthRaw+n);
178 CheckGroundTruth(structures, 2, 1, groundTruth);
179 }
180
181 {
182 double groundTruthRaw[] = { 108.3984, 232.7406, 274.01, 106.0547, 231.7948, 274.01, 103.7109, 232.8407, 274.01, 96.67969, 232.8757, 274.01, 77.92969, 232.887, 274.01, 47.46094, 232.8902, 274.01, 38.08594, 232.7537, 274.01, 37.6668, 232.3734, 274.01, 38.08594, 231.9774, 274.01, 40.42969, 231.8475, 274.01, 41.76413, 230.0297, 274.01, 42.77344, 229.1388, 274.01, 45.11719, 228.5069, 274.01, 47.46094, 227.1533, 274.01, 49.80469, 226.3505, 274.01, 52.14844, 224.6564, 274.01, 54.49219, 223.923, 274.01, 56.83594, 222.0692, 274.01, 59.17969, 220.3438, 274.01, 61.52344, 219.3888, 274.01, 63.86719, 217.1287, 274.01, 65.83488, 215.9672, 274.01, 68.55469, 213.2383, 274.01, 70.89844, 211.2328, 274.01, 72.8125, 208.9359, 274.01, 75.58594, 206.3615, 274.01, 76.91445, 204.2484, 274.01, 78.89509, 201.9047, 274.01, 80.51276, 199.5609, 274.01, 81.51955, 197.2172, 274.01, 83.67448, 194.8734, 274.01, 84.60938, 192.5297, 274.01, 85.86986, 190.1859, 274.01, 86.57623, 187.8422, 274.01, 88.30051, 185.4984, 274.01, 88.94002, 183.1547, 274.01, 89.23261, 180.8109, 274.01, 89.64844, 180.3263, 274.01, 90.71885, 178.4672, 274.01, 90.97656, 176.1234, 274.01, 91.99219, 174.4794, 274.01, 92.56773, 173.7797, 274.01, 92.80016, 171.4359, 274.01, 93.23473, 169.0922, 274.01, 93.37606, 166.7484, 274.01, 93.60748, 157.3734, 274.01, 93.6341, 152.6859, 274.01, 93.35742, 140.9672, 274.01, 92.89317, 138.6234, 274.01, 92.7069, 136.2797, 274.01, 92.03726, 133.9359, 274.01, 90.84009, 131.5922, 274.01, 90.3769, 129.2484, 274.01, 89.09074, 126.9047, 274.01, 88.13225, 122.2172, 274.01, 86.17828, 119.8734, 274.01, 84.96094, 117.4163, 274.01, 83.99619, 115.1859, 274.01, 83.13079, 112.8422, 274.01, 82.61719, 112.2984, 274.01, 80.27344, 108.8454, 274.01, 79.64514, 108.1547, 274.01, 77.21497, 105.8109, 274.01, 76.47787, 103.4672, 274.01, 75.58594, 102.6177, 274.01, 73.24219, 100.0077, 274.01, 69.54492, 96.43594, 274.01, 67.34096, 94.09219, 274.01, 64.66306, 91.74844, 274.01, 63.86719, 90.92619, 274.01, 61.52344, 90.20454, 274.01, 59.17969, 87.78574, 274.01, 56.83594, 86.48566, 274.01, 54.49219, 84.31388, 274.01, 52.14844, 83.44438, 274.01, 49.80469, 82.75121, 274.01, 49.37617, 82.37344, 274.01, 47.46094, 81.26244, 274.01, 45.71391, 80.02969, 274.01, 45.11719, 79.45415, 274.01, 42.77344, 79.08185, 274.01, 40.42969, 78.51941, 274.01, 38.08594, 78.27534, 274.01, 37.36932, 77.68594, 274.01, 35.74219, 76.67624, 274.01, 33.39844, 76.49941, 274.01, 31.05469, 76.03495, 274.01, 28.71094, 74.83174, 274.01, 26.36719, 74.62859, 274.01, 24.02344, 74.55463, 274.01, 21.67969, 74.22861, 274.01, 19.33594, 74.05312, 274.01, 12.30469, 73.99397, 274.01, 5.273438, 74.0736, 274.01, 2.929688, 74.55463, 274.01, 0.5859375, 74.68513, 274.01, -1.757813, 74.914, 274.01, -2.319131, 75.34219, 274.01, -4.101563, 76.31516, 274.01, -8.789063, 76.74514, 274.01, -11.13281, 78.39038, 274.01, -13.47656, 78.6124, 274.01, -15.82031, 79.19784, 274.01, -18.16406, 81.11024, 274.01, -20.50781, 82.03296, 274.01, -22.85156, 83.13991, 274.01, -25.19531, 83.70732, 274.01, -27.53906, 85.85863, 274.01, -29.88281, 87.03368, 274.01, -32.22656, 88.3274, 274.01, -34.57031, 90.53674, 274.01, -36.91406, 92.5602, 274.01, -39.25781, 93.55952, 274.01, -41.60156, 95.74537, 274.01, -43.94531, 98.26609, 274.01, -46.28906, 100.3701, 274.01, -47.02621, 101.1234, 274.01, -47.86611, 103.4672, 274.01, -49.83594, 105.8109, 274.01, -51.98182, 108.1547, 274.01, -53.06448, 110.4984, 274.01, -53.32031, 110.7675, 274.01, -54.53804, 112.8422, 274.01, -55.66406, 114.273, 274.01, -56.55722, 115.1859, 274.01, -57.13953, 117.5297, 274.01, -58.29264, 119.8734, 274.01, -59.26869, 122.2172, 274.01, -60.35156, 124.0119, 274.01, -60.84229, 124.5609, 274.01, -61.54484, 126.9047, 274.01, -61.71691, 129.2484, 274.01, -63.62281, 131.5922, 274.01, -63.81256, 133.9359, 274.01, -64.12511, 136.2797, 274.01, -64.84515, 138.6234, 274.01, -65.13599, 140.9672, 274.01, -65.33604, 143.3109, 274.01, -65.87358, 145.6547, 274.01, -66.10577, 147.9984, 274.01, -66.17618, 155.0297, 274.01, -66.09933, 162.0609, 274.01, -65.40382, 164.4047, 274.01, -65.24833, 166.7484, 274.01, -64.71442, 171.4359, 274.01, -63.88171, 173.7797, 274.01, -63.69299, 176.1234, 274.01, -61.79081, 178.4672, 274.01, -61.59269, 180.8109, 274.01, -61.19405, 183.1547, 274.01, -60.35156, 185.2055, 274.01, -59.08288, 187.8422, 274.01, -58.00781, 189.3499, 274.01, -57.25858, 190.1859, 274.01, -56.64558, 192.5297, 274.01, -55.29191, 194.8734, 274.01, -54.28698, 197.2172, 274.01, -52.28595, 199.5609, 274.01, -51.47569, 201.9047, 274.01, -48.63281, 204.6417, 274.01, -47.10181, 206.5922, 274.01, -44.64154, 208.9359, 274.01, -42.38504, 211.2797, 274.01, -39.25781, 214.4025, 274.01, -37.42723, 215.9672, 274.01, -34.57031, 218.9107, 274.01, -32.22656, 219.7277, 274.01, -29.88281, 221.6934, 274.01, -27.53906, 222.852, 274.01, -25.19531, 224.5168, 274.01, -22.85156, 225.9419, 274.01, -20.50781, 226.7359, 274.01, -18.16406, 228.3332, 274.01, -15.82031, 229.065, 274.01, -13.47656, 229.267, 274.01, -12.63854, 230.0297, 274.01, -11.13281, 231.9201, 274.01, -10.65505, 232.3734, 274.01, -11.13281, 232.7794, 274.01, -15.82031, 232.792, 274.01, -18.16406, 232.8902, 274.01, -36.91406, 232.9015, 274.01, -39.25781, 232.8902, 274.01, -50.97656, 232.9236, 274.01, -60.35156, 232.9126, 274.01, -67.38281, 232.8407, 274.01, -72.07031, 232.8642, 274.01, -79.10156, 232.8555, 274.01, -83.78906, 232.8788, 274.01, -95.50781, 232.8902, 274.01, -97.85156, 233.4886, 274.01, -100.1953, 233.647, 274.01, -102.5391, 232.9858, 274.01, -104.8828, 233.6969, 274.01, -109.5703, 233.722, 274.01, -125.9766, 233.7086, 274.01, -128.3203, 233.2849, 274.01, -130.6641, 233.702, 274.01, -135.3516, 233.727, 274.01, -149.4141, 233.7135, 274.01, -156.4453, 233.727, 274.01, -163.4766, 233.7119, 274.01, -168.1641, 233.7643, 274.01, -191.6016, 233.7809, 274.01, -210.3516, 233.7716, 274.01, -224.4141, 233.7998, 274.01, -233.7891, 233.7647, 274.01, -243.1641, 233.7785, 274.01, -247.8516, 233.7378, 274.01, -254.8828, 233.8578, 274.01, -257.2266, 235.2519, 274.01, -259.5703, 236.0817, 274.01, -260.7617, 237.0609, 274.01, -261.9141, 238.2262, 274.01, -262.8989, 239.4047, 274.01, -262.9743, 241.7484, 274.01, -262.5977, 244.0922, 274.01, -260.6675, 246.4359, 274.01, -259.6161, 248.7797, 274.01, -257.2266, 251.0035, 274.01, -255.0361, 253.4672, 274.01, -252.5391, 256.0995, 274.01, -251.2277, 258.1547, 274.01, -246.7444, 262.8422, 274.01, -243.1641, 266.3515, 274.01, -239.7411, 269.8734, 274.01, -238.4766, 270.9495, 274.01, -237.2269, 272.2172, 274.01, -236.1328, 273.5215, 274.01, -235.0934, 274.5609, 274.01, -233.7891, 275.6655, 274.01, -232.5319, 276.9047, 274.01, -231.4453, 278.1693, 274.01, -227.917, 281.5922, 274.01, -224.4141, 285.1802, 274.01, -222.0703, 287.4025, 274.01, -218.6841, 290.9672, 274.01, -217.3828, 291.9709, 274.01, -215.0391, 293.1788, 274.01, -212.6953, 294.5138, 274.01, -210.3516, 295.2614, 274.01, -209.8994, 295.6547, 274.01, -208.0078, 296.7083, 274.01, -203.3203, 296.9372, 274.01, -196.2891, 296.9317, 274.01, -193.9453, 296.8988, 274.01, -172.8516, 296.8482, 274.01, -161.1328, 296.843, 274.01, -137.6953, 296.8542, 274.01, -130.6641, 296.8378, 274.01, -107.2266, 296.8379, 274.01, -93.16406, 296.8208, 274.01, -74.41406, 296.838, 274.01, -65.03906, 296.8609, 274.01, -50.97656, 296.8556, 274.01, -46.28906, 296.9051, 274.01, -41.60156, 298.5331, 274.01, -39.25781, 298.5624, 274.01, -36.91406, 297.1455, 274.01, -34.57031, 297.0498, 274.01, -32.22656, 298.5589, 274.01, -25.19531, 298.5624, 274.01, -22.85156, 297.2842, 274.01, -20.50781, 298.5624, 274.01, -1.757813, 298.5624, 274.01, 0.5859375, 297.2104, 274.01, 2.929688, 298.5624, 274.01, 5.273438, 297.6946, 274.01, 7.617188, 298.5168, 274.01, 9.960938, 298.5512, 274.01, 12.30469, 296.937, 274.01, 14.64844, 298.5478, 274.01, 16.99219, 298.5478, 274.01, 19.33594, 297.0782, 274.01, 21.67969, 296.844, 274.01, 23.54531, 297.9984, 274.01, 24.02344, 298.4023, 274.01, 24.50156, 297.9984, 274.01, 26.36719, 296.844, 274.01, 38.08594, 296.8381, 274.01, 52.14844, 296.8033, 274.01, 59.17969, 296.8033, 274.01, 73.24219, 296.7682, 274.01, 99.02344, 296.7566, 274.01, 117.7734, 296.7216, 274.01, 129.4922, 296.7152, 274.01, 131.8359, 295.9083, 274.01, 134.1797, 295.5245, 274.01, 138.8672, 295.4763, 274.01, 155.2734, 295.4763, 274.01, 176.3672, 295.3861, 274.01, 190.4297, 295.3718, 274.01, 197.4609, 295.4763, 274.01, 202.1484, 295.4454, 274.01, 204.4922, 295.3438, 274.01, 206.8359, 295.0757, 274.01, 209.1797, 294.4124, 274.01, 211.5234, 292.3133, 274.01, 213.8672, 291.0809, 274.01, 216.2109, 289.6743, 274.01, 217.3081, 288.6234, 274.01, 219.3558, 286.2797, 274.01, 221.8608, 283.9359, 274.01, 225.5859, 280.045, 274.01, 227.9297, 277.8885, 274.01, 230.2734, 275.2857, 274.01, 232.6172, 273.2225, 274.01, 233.6225, 272.2172, 274.01, 234.9609, 270.5822, 274.01, 238.2254, 267.5297, 274.01, 240.3691, 265.1859, 274.01, 244.3359, 261.3326, 274.01, 246.6797, 258.8034, 274.01, 249.0234, 256.7196, 274.01, 251.3672, 254.0746, 274.01, 254.5313, 251.1234, 274.01, 255.333, 248.7797, 274.01, 257.3723, 246.4359, 274.01, 259.7201, 244.0922, 274.01, 260.106, 241.7484, 274.01, 261.6423, 239.4047, 274.01, 261.0804, 237.0609, 274.01, 259.3552, 234.7172, 274.01, 258.3984, 233.7696, 274.01, 256.0547, 232.8757, 274.01, 253.7109, 232.792, 274.01, 251.3672, 232.8161, 274.01, 246.6797, 232.6981, 274.01, 244.3359, 232.725, 274.01, 239.6484, 232.9137, 274.01, 234.9609, 232.8525, 274.01, 225.5859, 232.8757, 274.01, 209.1797, 232.8757, 274.01, 204.4922, 232.7537, 274.01, 195.1172, 232.7794, 274.01, 171.6797, 232.792, 274.01, 164.6484, 232.7666, 274.01, 152.9297, 232.7666, 274.01, 148.2422, 232.792, 274.01, 138.8672, 232.7406, 274.01 };
183 size_t n = sizeof(groundTruthRaw) / sizeof(groundTruthRaw[0]);
184 std::vector<double> groundTruth(groundTruthRaw, groundTruthRaw+n);
185 EXPECT_EQ(340u * 3, groundTruth.size());
186 CheckGroundTruth(structures, 5, 0, groundTruth);
187 }
188
189 {
190 double groundTruthRaw[] = { -18.16406, 233.0632, 298.01, -27.53906, 233.1042, 298.01, -29.88281, 233.0819, 298.01, -34.57031, 233.131, 298.01, -43.94531, 233.1221, 298.01, -50.97656, 233.1736, 298.01, -62.69531, 233.1397, 298.01, -65.03906, 232.8376, 298.01, -69.72656, 232.9839, 298.01, -79.10156, 233.0245, 298.01, -90.82031, 233.0382, 298.01, -93.16406, 233.0859, 298.01, -109.5703, 233.1132, 298.01, -111.9141, 233.1791, 298.01, -114.2578, 233.7139, 298.01, -118.9453, 233.9793, 298.01, -128.3203, 234.0284, 298.01, -130.6641, 233.9793, 298.01, -135.3516, 234.0591, 298.01, -137.6953, 234.0284, 298.01, -142.3828, 234.0855, 298.01, -144.7266, 234.0284, 298.01, -151.7578, 234.002, 298.01, -158.7891, 234.0263, 298.01, -163.4766, 233.9784, 298.01, -165.8203, 234.0072, 298.01, -168.1641, 234.1756, 298.01, -170.5078, 234.2214, 298.01, -179.8828, 234.1934, 298.01, -186.9141, 234.2721, 298.01, -189.2578, 234.2289, 298.01, -193.9453, 234.2431, 298.01, -198.6328, 234.1692, 298.01, -200.9766, 234.2326, 298.01, -205.6641, 234.1271, 298.01, -212.6953, 234.2224, 298.01, -215.0391, 234.1992, 298.01, -222.0703, 234.3115, 298.01, -224.4141, 234.2224, 298.01, -226.7578, 234.2502, 298.01, -233.7891, 234.0906, 298.01, -238.4766, 234.0329, 298.01, -243.1641, 234.0283, 298.01, -247.8516, 233.7949, 298.01, -250.1953, 233.8681, 298.01, -252.5391, 234.7626, 298.01, -254.3469, 237.0609, 298.01, -255.6034, 239.4047, 298.01, -254.5181, 241.7484, 298.01, -254.2274, 244.0922, 298.01, -254.181, 248.7797, 298.01, -253.9355, 251.1234, 298.01, -253.5926, 253.4672, 298.01, -252.7483, 255.8109, 298.01, -250.8092, 258.1547, 298.01, -248.713, 260.4984, 298.01, -246.263, 262.8422, 298.01, -244.1406, 265.1859, 298.01, -241.6671, 267.5297, 298.01, -239.4754, 269.8734, 298.01, -237.0156, 272.2172, 298.01, -233.7891, 275.382, 298.01, -231.4453, 277.8249, 298.01, -229.1016, 279.9981, 298.01, -226.7578, 282.5281, 298.01, -224.4141, 284.6784, 298.01, -222.0703, 287.2355, 298.01, -220.5414, 288.6234, 298.01, -218.2745, 290.9672, 298.01, -217.3828, 291.6508, 298.01, -212.6953, 294.5949, 298.01, -210.3516, 295.3142, 298.01, -208.0078, 296.4674, 298.01, -205.6641, 296.8852, 298.01, -203.3203, 297.1563, 298.01, -196.2891, 297.1488, 298.01, -193.9453, 297.0597, 298.01, -182.2266, 296.9529, 298.01, -168.1641, 296.8576, 298.01, -154.1016, 296.9249, 298.01, -149.4141, 296.8921, 298.01, -128.3203, 296.9228, 298.01, -121.2891, 296.8623, 298.01, -111.9141, 296.8549, 298.01, -107.2266, 296.8266, 298.01, -102.5391, 296.8731, 298.01, -95.50781, 296.8453, 298.01, -88.47656, 296.9218, 298.01, -83.78906, 296.9016, 298.01, -69.72656, 296.979, 298.01, -67.38281, 296.9514, 298.01, -65.03906, 297.2199, 298.01, -62.69531, 296.9622, 298.01, -55.66406, 296.9926, 298.01, -50.97656, 296.9467, 298.01, -48.63281, 297.3652, 298.01, -46.28906, 297.0439, 298.01, -43.94531, 297.2875, 298.01, -39.25781, 297.0121, 298.01, -34.57031, 297.1564, 298.01, -32.22656, 297.3612, 298.01, -29.88281, 297.4229, 298.01, -27.53906, 297.1687, 298.01, -25.19531, 297.4334, 298.01, -18.16406, 297.3612, 298.01, -15.82031, 297.4441, 298.01, -13.47656, 297.4125, 298.01, -11.13281, 297.2468, 298.01, -8.789063, 297.4125, 298.01, -6.445313, 297.373, 298.01, -4.101563, 297.4195, 298.01, -1.757813, 297.077, 298.01, 0.5859375, 297.4229, 298.01, 2.929688, 297.4125, 298.01, 5.273438, 296.9489, 298.01, 7.617188, 297.3168, 298.01, 9.960938, 296.9377, 298.01, 12.30469, 296.8998, 298.01, 14.64844, 297.1975, 298.01, 16.99219, 296.8579, 298.01, 28.71094, 296.878, 298.01, 40.42969, 296.8163, 298.01, 42.77344, 296.8369, 298.01, 49.80469, 296.734, 298.01, 59.17969, 296.6906, 298.01, 61.52344, 296.6365, 298.01, 68.55469, 296.6278, 298.01, 73.24219, 296.5777, 298.01, 75.58594, 296.6191, 298.01, 84.96094, 296.5284, 298.01, 96.67969, 296.5538, 298.01, 103.7109, 296.479, 298.01, 115.4297, 296.4259, 298.01, 122.4609, 296.3434, 298.01, 129.4922, 296.3495, 298.01, 131.8359, 295.9141, 298.01, 136.5234, 296.2256, 298.01, 138.8672, 295.833, 298.01, 143.5547, 295.9857, 298.01, 145.8984, 295.8791, 298.01, 152.9297, 295.833, 298.01, 164.6484, 295.6819, 298.01, 171.6797, 295.6819, 298.01, 181.0547, 295.5401, 298.01, 185.7422, 295.5742, 298.01, 192.7734, 295.557, 298.01, 197.4609, 295.8012, 298.01, 202.1484, 295.6819, 298.01, 204.4922, 295.3698, 298.01, 206.8359, 294.803, 298.01, 209.1797, 294.3656, 298.01, 211.5234, 292.4764, 298.01, 213.8672, 291.1765, 298.01, 216.2109, 289.5873, 298.01, 217.229, 288.6234, 298.01, 218.5547, 287.0752, 298.01, 221.7097, 283.9359, 298.01, 225.5859, 279.8775, 298.01, 227.9297, 277.5633, 298.01, 230.2734, 275.0808, 298.01, 233.1989, 272.2172, 298.01, 234.9609, 270.2887, 298.01, 237.7384, 267.5297, 298.01, 241.9922, 263.0843, 298.01, 244.3359, 260.7643, 298.01, 246.788, 258.1547, 298.01, 249.0234, 255.451, 298.01, 250.3651, 253.4672, 298.01, 251.5297, 251.1234, 298.01, 252.1947, 248.7797, 298.01, 252.4915, 246.4359, 298.01, 252.5755, 241.7484, 298.01, 252.8592, 239.4047, 298.01, 252.9236, 237.0609, 298.01, 252.2924, 234.7172, 298.01, 251.3672, 233.4697, 298.01, 249.0234, 232.882, 298.01, 244.3359, 232.9048, 298.01, 241.9922, 233.0145, 298.01, 232.6172, 232.9048, 298.01, 227.9297, 233.0007, 298.01, 216.2109, 233.0632, 298.01, 211.5234, 233.0537, 298.01, 206.8359, 232.9699, 298.01, 204.4922, 232.7322, 298.01, 199.8047, 232.7186, 298.01, 190.4297, 232.7719, 298.01, 183.3984, 232.7719, 298.01, 181.0547, 232.7322, 298.01, 174.0234, 232.7048, 298.01, 171.6797, 232.7322, 298.01, 166.9922, 232.6908, 298.01, 157.6172, 232.7975, 298.01, 155.2734, 232.7588, 298.01, 148.2422, 232.7875, 298.01, 143.5547, 232.7614, 298.01, 138.8672, 232.6477, 298.01, 124.8047, 232.6179, 298.01, 122.4609, 232.6477, 298.01, 113.0859, 232.6027, 298.01, 110.7422, 232.4552, 298.01, 108.3984, 232.2192, 298.01, 106.0547, 231.6764, 298.01, 103.7109, 231.8559, 298.01, 102.8237, 232.3734, 298.01, 101.3672, 232.9839, 298.01, 99.02344, 233.0951, 298.01, 87.30469, 233.0819, 298.01, 84.96094, 233.1091, 298.01, 80.27344, 233.0726, 298.01, 77.92969, 233.1132, 298.01, 70.89844, 233.1397, 298.01, 68.55469, 233.1132, 298.01, 52.14844, 233.131, 298.01, 45.11719, 233.0859, 298.01, 44.16726, 232.3734, 298.01, 42.77344, 231.0206, 298.01, 42.04498, 230.0297, 298.01, 42.77344, 229.2462, 298.01, 45.11719, 228.5664, 298.01, 47.46094, 227.0695, 298.01, 49.80469, 226.0552, 298.01, 52.14844, 224.5723, 298.01, 54.49219, 223.6857, 298.01, 56.83594, 221.8519, 298.01, 59.17969, 220.2086, 298.01, 61.52344, 218.8854, 298.01, 64.94469, 215.9672, 298.01, 66.21094, 215.0191, 298.01, 67.72036, 213.6234, 298.01, 68.55469, 212.6986, 298.01, 70.89844, 210.5055, 298.01, 74.53191, 206.5922, 298.01, 76.54903, 204.2484, 298.01, 78.26105, 201.9047, 298.01, 80.27344, 198.9262, 298.01, 82.61719, 195.2822, 298.01, 82.98087, 194.8734, 298.01, 84.96094, 190.9255, 298.01, 85.43701, 190.1859, 298.01, 86.33423, 187.8422, 298.01, 87.78722, 185.4984, 298.01, 88.60233, 183.1547, 298.01, 89.10253, 180.8109, 298.01, 90.17504, 178.4672, 298.01, 90.88959, 176.1234, 298.01, 91.43783, 173.7797, 298.01, 92.39601, 171.4359, 298.01, 92.95762, 169.0922, 298.01, 93.55695, 159.7172, 298.01, 93.65527, 157.3734, 298.01, 93.67542, 152.6859, 298.01, 93.61213, 150.3422, 298.01, 93.22542, 143.3109, 298.01, 93.06345, 140.9672, 298.01, 92.77563, 138.6234, 298.01, 91.21714, 133.9359, 298.01, 90.67235, 131.5922, 298.01, 89.88776, 129.2484, 298.01, 88.8737, 126.9047, 298.01, 88.44087, 124.5609, 298.01, 86.09712, 119.8734, 298.01, 85.05786, 117.5297, 298.01, 83.87151, 115.1859, 298.01, 82.22388, 112.8422, 298.01, 81.09117, 110.4984, 298.01, 77.92969, 106.4052, 298.01, 77.3894, 105.8109, 298.01, 75.94332, 103.4672, 298.01, 71.71799, 98.77969, 298.01, 68.55469, 95.65721, 298.01, 63.86719, 91.54878, 298.01, 61.52344, 90.1121, 298.01, 59.17969, 88.15762, 298.01, 56.83594, 86.51503, 298.01, 54.49219, 85.42721, 298.01, 52.14844, 83.64907, 298.01, 49.80469, 82.89023, 298.01, 47.46094, 81.50237, 298.01, 45.11719, 80.62591, 298.01, 42.77344, 79.18153, 298.01, 40.42969, 78.7203, 298.01, 38.08594, 78.1349, 298.01, 35.74219, 77.11755, 298.01, 33.39844, 76.51949, 298.01, 31.05469, 76.07934, 298.01, 26.36719, 74.67744, 298.01, 24.02344, 74.42056, 298.01, 14.64844, 74.07317, 298.01, 9.960938, 74.11538, 298.01, 2.929688, 74.40105, 298.01, 0.5859375, 74.67952, 298.01, -1.757813, 75.31406, 298.01, -4.101563, 76.07065, 298.01, -6.445313, 76.49051, 298.01, -8.789063, 77.17276, 298.01, -11.13281, 78.20097, 298.01, -15.82031, 79.31967, 298.01, -18.16406, 80.76948, 298.01, -20.50781, 81.64266, 298.01, -22.85156, 83.0305, 298.01, -25.19531, 83.7937, 298.01, -27.53906, 85.63515, 298.01, -29.88281, 86.7363, 298.01, -32.22656, 88.36089, 298.01, -34.57031, 90.3302, 298.01, -36.56719, 91.74844, 298.01, -41.60156, 95.93605, 298.01, -46.58845, 101.1234, 298.01, -50.17995, 105.8109, 298.01, -52.10386, 108.1547, 298.01, -53.63992, 110.4984, 298.01, -54.95532, 112.8422, 298.01, -56.64794, 115.1859, 298.01, -57.4403, 117.5297, 298.01, -58.91927, 119.8734, 298.01, -59.78655, 122.2172, 298.01, -61.11754, 124.5609, 298.01, -61.58921, 126.9047, 298.01, -62.38012, 129.2484, 298.01, -63.49118, 131.5922, 298.01, -64.02599, 133.9359, 298.01, -64.3932, 136.2797, 298.01, -65.11897, 138.6234, 298.01, -65.64544, 140.9672, 298.01, -66.23938, 147.9984, 298.01, -66.46289, 152.6859, 298.01, -66.48911, 155.0297, 298.01, -66.34437, 159.7172, 298.01, -65.99894, 164.4047, 298.01, -65.49149, 169.0922, 298.01, -64.6875, 171.4359, 298.01, -63.7739, 176.1234, 298.01, -62.9398, 178.4672, 298.01, -61.86011, 180.8109, 298.01, -61.33423, 183.1547, 298.01, -60.43332, 185.4984, 298.01, -58.00781, 190.0632, 298.01, -56.85406, 192.5297, 298.01, -55.66406, 194.7283, 298.01, -54.11692, 197.2172, 298.01, -50.97656, 201.8369, 298.01, -47.36435, 206.5922, 298.01, -45.04395, 208.9359, 298.01, -42.83026, 211.2797, 298.01, -39.25781, 214.7435, 298.01, -34.57031, 218.4974, 298.01, -32.22656, 219.9595, 298.01, -28.02053, 222.9984, 298.01, -27.53906, 223.4238, 298.01, -25.19531, 224.4187, 298.01, -22.85156, 225.8252, 298.01, -20.50781, 226.9067, 298.01, -18.16406, 228.4286, 298.01, -15.82031, 229.1235, 298.01, -14.9447, 230.0297, 298.01, -15.82031, 231.3969, 298.01, -16.94484, 232.3734, 298.01 };
191 size_t n = sizeof(groundTruthRaw) / sizeof(groundTruthRaw[0]);
192 std::vector<double> groundTruth(groundTruthRaw, groundTruthRaw+n);
193 EXPECT_EQ(358u * 3, groundTruth.size());
194 CheckGroundTruth(structures, 5, 8, groundTruth);
195 }
196 }
197
198 #endif
199 // BGO_ENABLE_DICOMSTRUCTURESETLOADER2
200
201 #if 0
202
203 TEST(StructureSet2, ReadFromJsonAndCompute1)
204 {
205 DicomStructureSet2 structureSet;
206
207 OrthancPlugins::FullOrthancDataset dicom(GetTestJson());
208 structureSet.Clear();
209
210 structureSet.FillStructuresFromDataset(dicom);
211
212 structureSet.ComputeDependentProperties();
213 }
214
215 TEST(StructureSet2, ReadFromJsonAndCompute2)
216 {
217 DicomStructureSet2 structureSet;
218
219 OrthancPlugins::FullOrthancDataset dicom(GetTestJson());
220 structureSet.Clear();
221
222 structureSet.SetContents(dicom);
223 }
224 #endif
225
226 #ifdef BGO_ENABLE_DICOMSTRUCTURESETLOADER2
227
228 static bool CutStructureWithPlane(
229 std::vector< std::pair<ScenePoint2D, ScenePoint2D> >& segments,
230 const DicomStructure2& structure,
231 const double originX, const double originY, const double originZ,
232 const double axisX_X, const double axisX_Y, const double axisX_Z,
233 const double axisY_X, const double axisY_Y, const double axisY_Z
234 )
235 {
236 // create an AXIAL cutting plane, too far away from the volume
237 // (> sliceThickness/2)
238 Vector origin, axisX, axisY;
239 LinearAlgebra::AssignVector(origin, originX, originY, originZ);
240 LinearAlgebra::AssignVector(axisX, axisX_X, axisX_Y, axisX_Z);
241 LinearAlgebra::AssignVector(axisY, axisY_X, axisY_Y, axisY_Z);
242 CoordinateSystem3D cuttingPlane(origin, axisX, axisY);
243
244 // compute intersection
245 bool ok = structure.Project(segments, cuttingPlane);
246 return ok;
247 }
248
249 #endif
250 // BGO_ENABLE_DICOMSTRUCTURESETLOADER2
251
252 #ifdef BGO_ENABLE_DICOMSTRUCTURESETLOADER2
253
254 static void CreateBasicStructure(DicomStructure2& structure)
255 {
256 // see https://www.dropbox.com/s/1o1vg53hsbvx4cc/test-rtstruct-polygons.jpg?dl=0
257 EXPECT_EQ(pointsCoord1Count, pointsCoord2Count);
258 EXPECT_EQ(11u, pointsCoord2Count);
259
260 for (size_t slice = 0; slice < 3; ++slice)
261 {
262 DicomStructurePolygon2 polygon("Oblomptu", "CLOSED_PLANAR");
263 for (size_t ip = 0; ip < pointsCoord1Count; ++ip)
264 {
265 Vector pt;
266 double pt0 = pointsCoord1[ip];
267 double pt1 = pointsCoord2[ip];
268 double pt2 = 4 * (static_cast<double>(slice) - 1); // -4, 0, 4
269 LinearAlgebra::AssignVector(pt, pt0, pt1, pt2);
270 polygon.AddPoint(pt);
271 }
272 structure.AddPolygon(polygon);
273 }
274 structure.ComputeDependentProperties();
275 }
276
277
278 TEST(StructureSet2, CutAxialOutsideTop)
279 {
280 DicomStructure2 structure;
281 CreateBasicStructure(structure);
282 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
283
284 // create an AXIAL cutting plane, too far away from the volume
285 // (> sliceThickness/2)
286 bool ok = CutStructureWithPlane(segments, structure,
287 0, 0, 7,
288 1, 0, 0,
289 0, 1, 0);
290 EXPECT_FALSE(ok);
291 }
292
293
294 TEST(StructureSet2, CutAxialOutsideBottom)
295 {
296 DicomStructure2 structure;
297 CreateBasicStructure(structure);
298 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
299
300 // create an AXIAL cutting plane, too far away from the volume
301 // (> sliceThickness/2)
302 bool ok = CutStructureWithPlane(segments, structure,
303 0, 0, -6.66,
304 1, 0, 0,
305 0, 1, 0);
306 EXPECT_FALSE(ok);
307 }
308
309 TEST(StructureSet2, CutAxialInsideClose)
310 {
311 DicomStructure2 structure;
312 CreateBasicStructure(structure);
313 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
314
315 // create an AXIAL cutting plane in the volume
316 bool ok = CutStructureWithPlane(segments, structure,
317 0, 0, 1.1,
318 1, 0, 0,
319 0, 1, 0);
320 EXPECT_TRUE(ok);
321 EXPECT_EQ(POLYGON_POINT_COUNT, segments.size());
322
323 for (size_t i = 0; i < segments.size(); ++i)
324 {
325 EXPECT_LT(i, POLYGON_POINT_COUNT);
326 EXPECT_LT(i, POLYGON_POINT_COUNT);
327
328 const ScenePoint2D& pt = segments[i].first;
329
330 // ...should be at the same location as the 3D coords since the plane
331 // is rooted at 0,0,0 with normal 0,0,1
332 EXPECT_NEAR(pt.GetX(), pointsCoord1[i], DELTA_MAX);
333 EXPECT_NEAR(pt.GetY(), pointsCoord2[i], DELTA_MAX);
334 }
335 }
336
337
338 TEST(StructureSet2, CutAxialInsideFar)
339 {
340 DicomStructure2 structure;
341 CreateBasicStructure(structure);
342 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
343
344 // create an AXIAL cutting plane
345 Vector origin, axisX, axisY;
346 LinearAlgebra::AssignVector(origin, 0, 0, 0);
347 LinearAlgebra::AssignVector(axisX, 1, 0, 0);
348 LinearAlgebra::AssignVector(axisY, 0, 1, 0);
349 CoordinateSystem3D cuttingPlane(origin, axisX, axisY);
350
351 // compute intersection
352 bool ok = structure.Project(segments, cuttingPlane);
353 EXPECT_TRUE(ok);
354
355 EXPECT_EQ(11u, segments.size());
356 for (size_t i = 0; i < segments.size(); ++i)
357 {
358 EXPECT_LT(i, pointsCoord1Count);
359 EXPECT_LT(i, pointsCoord2Count);
360
361 // the 2D points of the projected polygon
362 const ScenePoint2D& pt = segments[i].first;
363
364 // ...should be at the same location as the 3D coords since the plane
365 // is rooted at 0,0,0 with normal 0,0,1
366 EXPECT_NEAR(pt.GetX(), pointsCoord1[i], DELTA_MAX);
367 EXPECT_NEAR(pt.GetY(), pointsCoord2[i], DELTA_MAX);
368 }
369 }
370
371 TEST(StructureSet2, CutCoronalOutsideClose)
372 {
373 DicomStructure2 structure;
374 CreateBasicStructure(structure);
375 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
376
377 // create an X,Z cutting plane, outside of the volume
378 Vector origin, axisX, axisY;
379 LinearAlgebra::AssignVector(origin, 0, 0, 0);
380 LinearAlgebra::AssignVector(axisX, 1, 0, 0);
381 LinearAlgebra::AssignVector(axisY, 0, 0, 1);
382 CoordinateSystem3D cuttingPlane(origin, axisX, axisY);
383
384 // compute intersection
385 bool ok = structure.Project(segments, cuttingPlane);
386 EXPECT_FALSE(ok);
387 }
388
389 TEST(StructureSet2, CutCoronalInsideClose1DTest)
390 {
391 DicomStructure2 structure;
392 CreateBasicStructure(structure);
393
394 // create an X,Z cutting plane, outside of the volume
395 Vector origin, axisX, axisY;
396 LinearAlgebra::AssignVector(origin, 0, 3, 0);
397 LinearAlgebra::AssignVector(axisX, 1, 0, 0);
398 LinearAlgebra::AssignVector(axisY, 0, 0, 1);
399 CoordinateSystem3D cuttingPlane(origin, axisX, axisY);
400
401 ASSERT_EQ(3u, structure.GetPolygons().size());
402
403 for (int i = 0; i < 3; ++i)
404 {
405 double polygonZ = static_cast<double>(i - 1) * 4.0;
406
407 const DicomStructurePolygon2& topSlab = structure.GetPolygons()[i];
408
409 // let's compute the intersection between the polygon and the plane
410 // intersections are in plane coords
411 std::vector<ScenePoint2D> intersects;
412 topSlab.ProjectOnConstantPlane(intersects, cuttingPlane);
413
414 ASSERT_EQ(4u, intersects.size());
415
416 EXPECT_NEAR(2, intersects[0].GetX(), DELTA_MAX);
417 EXPECT_NEAR(4, intersects[1].GetX(), DELTA_MAX);
418 EXPECT_NEAR(7, intersects[2].GetX(), DELTA_MAX);
419 EXPECT_NEAR(8, intersects[3].GetX(), DELTA_MAX);
420
421 for (size_t i = 0; i < 4u; ++i)
422 {
423 EXPECT_NEAR(polygonZ, intersects[i].GetY(), DELTA_MAX);
424 }
425 }
426 }
427
428 TEST(StructureSet2, CutCoronalInsideClose)
429 {
430 DicomStructure2 structure;
431 CreateBasicStructure(structure);
432 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
433
434 // create an X,Z cutting plane, outside of the volume
435 Vector origin, axisX, axisY;
436 LinearAlgebra::AssignVector(origin, 0, 3, 0);
437 LinearAlgebra::AssignVector(axisX, 1, 0, 0);
438 LinearAlgebra::AssignVector(axisY, 0, 0, 1);
439 CoordinateSystem3D cuttingPlane(origin, axisX, axisY);
440
441 // compute intersection
442 ASSERT_TRUE(structure.Project(segments, cuttingPlane));
443 EXPECT_EQ(24u, segments.size());
444
445 size_t numberOfVeryShortSegments = 0;
446 for (size_t iSegment = 0; iSegment < segments.size(); ++iSegment)
447 {
448 // count the NON vertical very short segments
449 if (LinearAlgebra::IsNear(segments[iSegment].first.GetX(), segments[iSegment].second.GetX()))
450 {
451 if (LinearAlgebra::IsNear(segments[iSegment].first.GetY(), segments[iSegment].second.GetY()))
452 {
453 numberOfVeryShortSegments++;
454 }
455 }
456 }
457 EXPECT_EQ(8u, numberOfVeryShortSegments);
458 }
459
460 #endif
461 // BGO_ENABLE_DICOMSTRUCTURESETLOADER2
462
463 TEST(DisjointDataSet, BasicTest)
464 {
465 const size_t ITEM_COUNT = 10;
466 DisjointDataSet ds(ITEM_COUNT);
467
468 for (size_t i = 0; i < ITEM_COUNT; ++i)
469 {
470 EXPECT_EQ(i, ds.Find(i));
471 }
472
473 ds.Union(0, 4);
474 EXPECT_EQ(0u, ds.Find(0));
475 EXPECT_EQ(0u, ds.Find(4));
476
477 ds.Union(4, 6);
478 ds.Union(8, 9);
479 ds.Union(0, 8);
480
481 for (size_t i = 0; i < ITEM_COUNT; ++i)
482 {
483 size_t parent = ds.Find(i);
484 EXPECT_TRUE(0 == parent || 1 == parent || 2 == parent || 3 == parent || 5 == parent || 7 == parent);
485 }
486
487 ds.Union(1, 2);
488 ds.Union(1, 7);
489 for (size_t i = 0; i < ITEM_COUNT; ++i)
490 {
491 size_t parent = ds.Find(i);
492 EXPECT_TRUE(0 == parent || 1 == parent || 3 == parent || 5 == parent);
493 }
494
495 ds.Union(3, 5);
496 for (size_t i = 0; i < ITEM_COUNT; ++i)
497 {
498 size_t parent = ds.Find(i);
499 EXPECT_TRUE(0 == parent || 1 == parent || 3 == parent);
500 }
501
502 EXPECT_EQ(ds.Find(0), ds.Find(0));
503 EXPECT_EQ(ds.Find(0), ds.Find(4));
504 EXPECT_EQ(ds.Find(0), ds.Find(6));
505 EXPECT_EQ(ds.Find(0), ds.Find(8));
506 EXPECT_EQ(ds.Find(0), ds.Find(8));
507
508 EXPECT_EQ(ds.Find(1), ds.Find(7));
509 EXPECT_EQ(ds.Find(2), ds.Find(1));
510 EXPECT_EQ(ds.Find(7), ds.Find(2));
511
512 EXPECT_EQ(ds.Find(3), ds.Find(5));
513 EXPECT_EQ(ds.Find(5), ds.Find(3));
514
515 ds.Union(0, 1);
516 ds.Union(3, 1);
517 for (size_t i = 0; i < ITEM_COUNT; ++i)
518 {
519 EXPECT_EQ(ds.Find(0), ds.Find(i));
520 }
521 }
522
523 #ifdef BGO_ENABLE_DICOMSTRUCTURESETLOADER2
524
525 TEST(StructureSet2, CutSagittalInsideClose)
526 {
527 DicomStructure2 structure;
528 CreateBasicStructure(structure);
529 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
530
531 // create an X,Z cutting plane, inside of the volume
532 Vector origin, axisX, axisY;
533 LinearAlgebra::AssignVector(origin, 0, 3, 0);
534 LinearAlgebra::AssignVector(axisX, 1, 0, 0);
535 LinearAlgebra::AssignVector(axisY, 0, 0, 1);
536 CoordinateSystem3D cuttingPlane(origin, axisX, axisY);
537
538 // compute intersection
539 bool ok = structure.Project(segments, cuttingPlane);
540 EXPECT_TRUE(ok);
541 }
542
543 #endif
544 // BGO_ENABLE_DICOMSTRUCTURESETLOADER2
545
546
547 static size_t ConvertListOfSlabsToSegments_Add(RtStructRectanglesInSlab& rectangles, int row, double xmin, double xmax)
548 {
549 double ymin = static_cast<double>(row) * 5.0;
550 double ymax = static_cast<double>(row + 1) * 5.0;
551
552 RtStructRectangleInSlab rectangle;
553 rectangle.xmin = xmin;
554 rectangle.xmax = xmax;
555 rectangle.ymin = ymin;
556 rectangle.ymax = ymax;
557
558 rectangles.push_back(rectangle);
559
560 return 1u;
561 }
562
563 static size_t FillTestRectangleList(std::vector< RtStructRectanglesInSlab >& rectanglesForEachSlab)
564 {
565 // ConvertListOfSlabsToSegments
566 size_t rectCount = 0;
567
568 rectanglesForEachSlab.push_back(RtStructRectanglesInSlab());
569 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 0, 5, 31);
570 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 0, 36, 50);
571
572 rectanglesForEachSlab.push_back(RtStructRectanglesInSlab());
573 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 1, 20, 45);
574 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 1, 52, 70);
575
576 rectanglesForEachSlab.push_back(RtStructRectanglesInSlab());
577 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 2, 0, 32);
578 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 2, 35, 44);
579 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 2, 60, 75);
580
581 rectanglesForEachSlab.push_back(RtStructRectanglesInSlab());
582 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 3, 10, 41);
583 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 3, 46, 80);
584
585 rectanglesForEachSlab.push_back(RtStructRectanglesInSlab());
586 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 4, 34, 42);
587 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 4, 90, 96);
588
589 rectanglesForEachSlab.push_back(RtStructRectanglesInSlab());
590 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 5, 1, 33);
591 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 5, 40, 43);
592 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 5, 51, 61);
593 rectCount += ConvertListOfSlabsToSegments_Add(rectanglesForEachSlab.back(), 5, 76, 95);
594
595 return rectCount;
596 }
597
598 /*
599 void AddSlabBoundaries(
600 std::vector<std::pair<double, RectangleBoundaryKind> >& boundaries,
601 const std::vector<RtStructRectanglesInSlab>& slabCuts, size_t iSlab)
602 */
603
604
605 /*
606 void ProcessBoundaryList(
607 std::vector< std::pair<ScenePoint2D, ScenePoint2D> >& segments,
608 const std::vector<std::pair<double, RectangleBoundaryKind> >& boundaries,
609 double y)
610 */
611
612
613 TEST(StructureSet2, ProcessBoundaryList_Empty)
614 {
615 std::vector< RtStructRectanglesInSlab > slabCuts;
616 std::vector<std::pair<double, RectangleBoundaryKind> > boundaries;
617
618 boundaries.clear();
619 EXPECT_NO_THROW(AddSlabBoundaries(boundaries, slabCuts, 0));
620 ASSERT_EQ(0u, boundaries.size());
621 }
622
623 TEST(StructureSet2, ProcessBoundaryListTopRow)
624 {
625 std::vector< RtStructRectanglesInSlab > slabCuts;
626 std::vector<std::pair<double, RectangleBoundaryKind> > boundaries;
627 FillTestRectangleList(slabCuts);
628
629 boundaries.clear();
630 AddSlabBoundaries(boundaries, slabCuts, 0);
631
632 {
633 size_t i = 0;
634 ASSERT_EQ(4u, boundaries.size());
635
636 ASSERT_EQ(RectangleBoundaryKind_Start, boundaries[i].second);
637 ASSERT_NEAR(5, boundaries[i].first, DELTA_MAX);
638 i++;
639
640 ASSERT_EQ(RectangleBoundaryKind_End, boundaries[i].second);
641 ASSERT_NEAR(31, boundaries[i].first, DELTA_MAX);
642 i++;
643
644 ASSERT_EQ(RectangleBoundaryKind_Start, boundaries[i].second);
645 ASSERT_NEAR(36, boundaries[i].first, DELTA_MAX);
646 i++;
647
648 ASSERT_EQ(RectangleBoundaryKind_End, boundaries[i].second);
649 ASSERT_NEAR(50, boundaries[i].first, DELTA_MAX);
650 i++;
651 }
652 }
653
654 TEST(StructureSet2, ProcessBoundaryListRows_0_and_1)
655 {
656 std::vector< RtStructRectanglesInSlab > slabCuts;
657 std::vector<std::pair<double, RectangleBoundaryKind> > boundaries;
658 FillTestRectangleList(slabCuts);
659
660 boundaries.clear();
661 AddSlabBoundaries(boundaries, slabCuts, 0);
662 AddSlabBoundaries(boundaries, slabCuts, 1);
663
664 ASSERT_EQ(8u, boundaries.size());
665
666 {
667 size_t i = 0;
668
669 ASSERT_EQ(RectangleBoundaryKind_Start, boundaries[i].second);
670 ASSERT_NEAR(5, boundaries[i].first, DELTA_MAX);
671 i++;
672
673 ASSERT_EQ(RectangleBoundaryKind_Start, boundaries[i].second);
674 ASSERT_NEAR(20, boundaries[i].first, DELTA_MAX);
675 i++;
676
677 ASSERT_EQ(RectangleBoundaryKind_End, boundaries[i].second);
678 ASSERT_NEAR(31, boundaries[i].first, DELTA_MAX);
679 i++;
680
681 ASSERT_EQ(RectangleBoundaryKind_Start, boundaries[i].second);
682 ASSERT_NEAR(36, boundaries[i].first, DELTA_MAX);
683 i++;
684
685 ASSERT_EQ(RectangleBoundaryKind_End, boundaries[i].second);
686 ASSERT_NEAR(45, boundaries[i].first, DELTA_MAX);
687 i++;
688
689 ASSERT_EQ(RectangleBoundaryKind_End, boundaries[i].second);
690 ASSERT_NEAR(50, boundaries[i].first, DELTA_MAX);
691 i++;
692
693 ASSERT_EQ(RectangleBoundaryKind_Start, boundaries[i].second);
694 ASSERT_NEAR(52, boundaries[i].first, DELTA_MAX);
695 i++;
696
697 ASSERT_EQ(RectangleBoundaryKind_End, boundaries[i].second);
698 ASSERT_NEAR(70, boundaries[i].first, DELTA_MAX);
699 i++;
700 }
701 }
702
703 TEST(StructureSet2, ConvertListOfSlabsToSegments_EmptyBoundaries)
704 {
705 std::vector< RtStructRectanglesInSlab > slabCuts;
706 std::vector<std::pair<double, RectangleBoundaryKind> > boundaries;
707 FillTestRectangleList(slabCuts);
708 boundaries.clear();
709 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
710 ASSERT_NO_THROW(ProcessBoundaryList(segments, boundaries, 42.0));
711 ASSERT_EQ(0u, segments.size());
712 }
713
714 TEST(StructureSet2, ConvertListOfSlabsToSegments_TopRow_Horizontal)
715 {
716 std::vector< RtStructRectanglesInSlab > slabCuts;
717 FillTestRectangleList(slabCuts);
718
719 // top row
720 {
721 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
722 std::vector<std::pair<double, RectangleBoundaryKind> > boundaries;
723 AddSlabBoundaries(boundaries, slabCuts, 0);
724 ProcessBoundaryList(segments, boundaries, slabCuts[0][0].ymin);
725
726 ASSERT_EQ(2u, segments.size());
727
728 ASSERT_NEAR( 5.0, segments[0].first.GetX(), DELTA_MAX);
729 ASSERT_NEAR(31.0, segments[0].second.GetX(), DELTA_MAX);
730 ASSERT_NEAR( 0.0, segments[0].first.GetY(), DELTA_MAX);
731 ASSERT_NEAR( 0.0, segments[0].second.GetY(), DELTA_MAX);
732
733 ASSERT_NEAR(36.0, segments[1].first.GetX(), DELTA_MAX);
734 ASSERT_NEAR(50.0, segments[1].second.GetX(), DELTA_MAX);
735 ASSERT_NEAR( 0.0, segments[1].first.GetY(), DELTA_MAX);
736 ASSERT_NEAR( 0.0, segments[1].second.GetY(), DELTA_MAX);
737 }
738 }
739
740 TEST(StructureSet2, ConvertListOfSlabsToSegments_All_Horizontal)
741 {
742 std::vector< RtStructRectanglesInSlab > slabCuts;
743 std::vector<std::pair<double, RectangleBoundaryKind> > boundaries;
744 FillTestRectangleList(slabCuts);
745
746 // top row
747 {
748 std::vector<std::pair<double, RectangleBoundaryKind> > boundaries;
749 AddSlabBoundaries(boundaries, slabCuts, 0);
750 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
751 ProcessBoundaryList(segments, boundaries, slabCuts[0][0].ymin);
752 }
753
754 // mids
755 {
756 std::vector<std::pair<double, RectangleBoundaryKind> > boundaries;
757 AddSlabBoundaries(boundaries, slabCuts, 0);
758 AddSlabBoundaries(boundaries, slabCuts, 1);
759 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
760 ProcessBoundaryList(segments, boundaries, slabCuts[0][0].ymax);
761
762 ASSERT_EQ(4u, segments.size());
763
764 ASSERT_NEAR(05.0, segments[0].first.GetX(), DELTA_MAX);
765 ASSERT_NEAR(20.0, segments[0].second.GetX(), DELTA_MAX);
766 ASSERT_NEAR(05.0, segments[0].first.GetY(), DELTA_MAX);
767 ASSERT_NEAR(05.0, segments[0].second.GetY(), DELTA_MAX);
768
769 ASSERT_NEAR(31.0, segments[1].first.GetX(), DELTA_MAX);
770 ASSERT_NEAR(36.0, segments[1].second.GetX(), DELTA_MAX);
771 ASSERT_NEAR(05.0, segments[1].first.GetY(), DELTA_MAX);
772 ASSERT_NEAR(05.0, segments[1].second.GetY(), DELTA_MAX);
773
774 ASSERT_NEAR(45.0, segments[2].first.GetX(), DELTA_MAX);
775 ASSERT_NEAR(50.0, segments[2].second.GetX(), DELTA_MAX);
776 ASSERT_NEAR(05.0, segments[2].first.GetY(), DELTA_MAX);
777 ASSERT_NEAR(05.0, segments[2].second.GetY(), DELTA_MAX);
778
779 ASSERT_NEAR(52.0, segments[3].first.GetX(), DELTA_MAX);
780 ASSERT_NEAR(70.0, segments[3].second.GetX(), DELTA_MAX);
781 ASSERT_NEAR(05.0, segments[3].first.GetY(), DELTA_MAX);
782 ASSERT_NEAR(05.0, segments[3].second.GetY(), DELTA_MAX);
783 }
784
785 // bottom row
786 {
787 std::vector<std::pair<double, RectangleBoundaryKind> > boundaries;
788 AddSlabBoundaries(boundaries, slabCuts, 1);
789 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
790 ProcessBoundaryList(segments, boundaries, slabCuts[1][0].ymax);
791
792 ASSERT_EQ(2u, segments.size());
793
794 ASSERT_NEAR(20.0, segments[0].first.GetX(), DELTA_MAX);
795 ASSERT_NEAR(45.0, segments[0].second.GetX(), DELTA_MAX);
796 ASSERT_NEAR(10.0, segments[0].first.GetY(), DELTA_MAX);
797 ASSERT_NEAR(10.0, segments[0].second.GetY(), DELTA_MAX);
798
799 ASSERT_NEAR(52.0, segments[1].first.GetX(), DELTA_MAX);
800 ASSERT_NEAR(70.0, segments[1].second.GetX(), DELTA_MAX);
801 ASSERT_NEAR(10.0, segments[1].first.GetY(), DELTA_MAX);
802 ASSERT_NEAR(10.0, segments[1].second.GetY(), DELTA_MAX);
803 }
804
805 }
806
807 TEST(StructureSet2, ConvertListOfSlabsToSegments_Complete_Empty)
808 {
809 std::vector< RtStructRectanglesInSlab > slabCuts;
810 std::vector<std::pair<double, RectangleBoundaryKind> > boundaries;
811
812 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
813
814 ASSERT_NO_THROW(ConvertListOfSlabsToSegments(segments, slabCuts, 0));
815 ASSERT_EQ(0u, segments.size());
816 }
817
818 TEST(StructureSet2, ConvertListOfSlabsToSegments_Complete_Regular)
819 {
820 std::vector< RtStructRectanglesInSlab > slabCuts;
821 std::vector<std::pair<double, RectangleBoundaryKind> > boundaries;
822 size_t totalRectCount = FillTestRectangleList(slabCuts);
823
824 std::vector< std::pair<ScenePoint2D, ScenePoint2D> > segments;
825
826 ASSERT_NO_THROW(ConvertListOfSlabsToSegments(segments, slabCuts, totalRectCount));
827 ASSERT_EQ(60u, segments.size());
828
829 size_t i = 0;
830
831 ASSERT_NEAR(segments[i].first.GetX(), 5.0000000000000000, DELTA_MAX);
832 ASSERT_NEAR(segments[i].first.GetY(), 0.0000000000000000, DELTA_MAX);
833 ASSERT_NEAR(segments[i].second.GetX(), 5.0000000000000000, DELTA_MAX);
834 ASSERT_NEAR(segments[i].second.GetY(), 5.0000000000000000, DELTA_MAX);
835 i++;
836 ASSERT_NEAR(segments[i].first.GetX(), 31.000000000000000, DELTA_MAX);
837 ASSERT_NEAR(segments[i].first.GetY(), 0.0000000000000000, DELTA_MAX);
838 ASSERT_NEAR(segments[i].second.GetX(), 31.000000000000000, DELTA_MAX);
839 ASSERT_NEAR(segments[i].second.GetY(), 5.0000000000000000, DELTA_MAX);
840 i++;
841 ASSERT_NEAR(segments[i].first.GetX(), 36.000000000000000, DELTA_MAX);
842 ASSERT_NEAR(segments[i].first.GetY(), 0.0000000000000000, DELTA_MAX);
843 ASSERT_NEAR(segments[i].second.GetX(), 36.000000000000000, DELTA_MAX);
844 ASSERT_NEAR(segments[i].second.GetY(), 5.0000000000000000, DELTA_MAX);
845 i++;
846 ASSERT_NEAR(segments[i].first.GetX(), 50.000000000000000, DELTA_MAX);
847 ASSERT_NEAR(segments[i].first.GetY(), 0.0000000000000000, DELTA_MAX);
848 ASSERT_NEAR(segments[i].second.GetX(), 50.000000000000000, DELTA_MAX);
849 ASSERT_NEAR(segments[i].second.GetY(), 5.0000000000000000, DELTA_MAX);
850 i++;
851 ASSERT_NEAR(segments[i].first.GetX(), 20.000000000000000, DELTA_MAX);
852 ASSERT_NEAR(segments[i].first.GetY(), 5.0000000000000000, DELTA_MAX);
853 ASSERT_NEAR(segments[i].second.GetX(), 20.000000000000000, DELTA_MAX);
854 ASSERT_NEAR(segments[i].second.GetY(), 10.000000000000000, DELTA_MAX);
855 i++;
856 ASSERT_NEAR(segments[i].first.GetX(), 45.000000000000000, DELTA_MAX);
857 ASSERT_NEAR(segments[i].first.GetY(), 5.0000000000000000, DELTA_MAX);
858 ASSERT_NEAR(segments[i].second.GetX(), 45.000000000000000, DELTA_MAX);
859 ASSERT_NEAR(segments[i].second.GetY(), 10.000000000000000, DELTA_MAX);
860 i++;
861 ASSERT_NEAR(segments[i].first.GetX(), 52.000000000000000, DELTA_MAX);
862 ASSERT_NEAR(segments[i].first.GetY(), 5.0000000000000000, DELTA_MAX);
863 ASSERT_NEAR(segments[i].second.GetX(), 52.000000000000000, DELTA_MAX);
864 ASSERT_NEAR(segments[i].second.GetY(), 10.000000000000000, DELTA_MAX);
865 i++;
866 ASSERT_NEAR(segments[i].first.GetX(), 70.000000000000000, DELTA_MAX);
867 ASSERT_NEAR(segments[i].first.GetY(), 5.0000000000000000, DELTA_MAX);
868 ASSERT_NEAR(segments[i].second.GetX(), 70.000000000000000, DELTA_MAX);
869 ASSERT_NEAR(segments[i].second.GetY(), 10.000000000000000, DELTA_MAX);
870 i++;
871 ASSERT_NEAR(segments[i].first.GetX(), 0.0000000000000000, DELTA_MAX);
872 ASSERT_NEAR(segments[i].first.GetY(), 10.000000000000000, DELTA_MAX);
873 ASSERT_NEAR(segments[i].second.GetX(), 0.0000000000000000, DELTA_MAX);
874 ASSERT_NEAR(segments[i].second.GetY(), 15.000000000000000, DELTA_MAX);
875 i++;
876 ASSERT_NEAR(segments[i].first.GetX(), 32.000000000000000, DELTA_MAX);
877 ASSERT_NEAR(segments[i].first.GetY(), 10.000000000000000, DELTA_MAX);
878 ASSERT_NEAR(segments[i].second.GetX(), 32.000000000000000, DELTA_MAX);
879 ASSERT_NEAR(segments[i].second.GetY(), 15.000000000000000, DELTA_MAX);
880 i++;
881 ASSERT_NEAR(segments[i].first.GetX(), 35.000000000000000, DELTA_MAX);
882 ASSERT_NEAR(segments[i].first.GetY(), 10.000000000000000, DELTA_MAX);
883 ASSERT_NEAR(segments[i].second.GetX(), 35.000000000000000, DELTA_MAX);
884 ASSERT_NEAR(segments[i].second.GetY(), 15.000000000000000, DELTA_MAX);
885 i++;
886 ASSERT_NEAR(segments[i].first.GetX(), 44.000000000000000, DELTA_MAX);
887 ASSERT_NEAR(segments[i].first.GetY(), 10.000000000000000, DELTA_MAX);
888 ASSERT_NEAR(segments[i].second.GetX(), 44.000000000000000, DELTA_MAX);
889 ASSERT_NEAR(segments[i].second.GetY(), 15.000000000000000, DELTA_MAX);
890 i++;
891 ASSERT_NEAR(segments[i].first.GetX(), 60.000000000000000, DELTA_MAX);
892 ASSERT_NEAR(segments[i].first.GetY(), 10.000000000000000, DELTA_MAX);
893 ASSERT_NEAR(segments[i].second.GetX(), 60.000000000000000, DELTA_MAX);
894 ASSERT_NEAR(segments[i].second.GetY(), 15.000000000000000, DELTA_MAX);
895 i++;
896 ASSERT_NEAR(segments[i].first.GetX(), 75.000000000000000, DELTA_MAX);
897 ASSERT_NEAR(segments[i].first.GetY(), 10.000000000000000, DELTA_MAX);
898 ASSERT_NEAR(segments[i].second.GetX(), 75.000000000000000, DELTA_MAX);
899 ASSERT_NEAR(segments[i].second.GetY(), 15.000000000000000, DELTA_MAX);
900 i++;
901 ASSERT_NEAR(segments[i].first.GetX(), 10.000000000000000, DELTA_MAX);
902 ASSERT_NEAR(segments[i].first.GetY(), 15.000000000000000, DELTA_MAX);
903 ASSERT_NEAR(segments[i].second.GetX(), 10.000000000000000, DELTA_MAX);
904 ASSERT_NEAR(segments[i].second.GetY(), 20.000000000000000, DELTA_MAX);
905 i++;
906 ASSERT_NEAR(segments[i].first.GetX(), 41.000000000000000, DELTA_MAX);
907 ASSERT_NEAR(segments[i].first.GetY(), 15.000000000000000, DELTA_MAX);
908 ASSERT_NEAR(segments[i].second.GetX(), 41.000000000000000, DELTA_MAX);
909 ASSERT_NEAR(segments[i].second.GetY(), 20.000000000000000, DELTA_MAX);
910 i++;
911 ASSERT_NEAR(segments[i].first.GetX(), 46.000000000000000, DELTA_MAX);
912 ASSERT_NEAR(segments[i].first.GetY(), 15.000000000000000, DELTA_MAX);
913 ASSERT_NEAR(segments[i].second.GetX(), 46.000000000000000, DELTA_MAX);
914 ASSERT_NEAR(segments[i].second.GetY(), 20.000000000000000, DELTA_MAX);
915 i++;
916 ASSERT_NEAR(segments[i].first.GetX(), 80.000000000000000, DELTA_MAX);
917 ASSERT_NEAR(segments[i].first.GetY(), 15.000000000000000, DELTA_MAX);
918 ASSERT_NEAR(segments[i].second.GetX(), 80.000000000000000, DELTA_MAX);
919 ASSERT_NEAR(segments[i].second.GetY(), 20.000000000000000, DELTA_MAX);
920 i++;
921 ASSERT_NEAR(segments[i].first.GetX(), 34.000000000000000, DELTA_MAX);
922 ASSERT_NEAR(segments[i].first.GetY(), 20.000000000000000, DELTA_MAX);
923 ASSERT_NEAR(segments[i].second.GetX(), 34.000000000000000, DELTA_MAX);
924 ASSERT_NEAR(segments[i].second.GetY(), 25.000000000000000, DELTA_MAX);
925 i++;
926 ASSERT_NEAR(segments[i].first.GetX(), 42.000000000000000, DELTA_MAX);
927 ASSERT_NEAR(segments[i].first.GetY(), 20.000000000000000, DELTA_MAX);
928 ASSERT_NEAR(segments[i].second.GetX(), 42.000000000000000, DELTA_MAX);
929 ASSERT_NEAR(segments[i].second.GetY(), 25.000000000000000, DELTA_MAX);
930 i++;
931 ASSERT_NEAR(segments[i].first.GetX(), 90.000000000000000, DELTA_MAX);
932 ASSERT_NEAR(segments[i].first.GetY(), 20.000000000000000, DELTA_MAX);
933 ASSERT_NEAR(segments[i].second.GetX(), 90.000000000000000, DELTA_MAX);
934 ASSERT_NEAR(segments[i].second.GetY(), 25.000000000000000, DELTA_MAX);
935 i++;
936 ASSERT_NEAR(segments[i].first.GetX(), 96.000000000000000, DELTA_MAX);
937 ASSERT_NEAR(segments[i].first.GetY(), 20.000000000000000, DELTA_MAX);
938 ASSERT_NEAR(segments[i].second.GetX(), 96.000000000000000, DELTA_MAX);
939 ASSERT_NEAR(segments[i].second.GetY(), 25.000000000000000, DELTA_MAX);
940 i++;
941 ASSERT_NEAR(segments[i].first.GetX(), 1.0000000000000000, DELTA_MAX);
942 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
943 ASSERT_NEAR(segments[i].second.GetX(), 1.0000000000000000, DELTA_MAX);
944 ASSERT_NEAR(segments[i].second.GetY(), 30.000000000000000, DELTA_MAX);
945 i++;
946 ASSERT_NEAR(segments[i].first.GetX(), 33.000000000000000, DELTA_MAX);
947 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
948 ASSERT_NEAR(segments[i].second.GetX(), 33.000000000000000, DELTA_MAX);
949 ASSERT_NEAR(segments[i].second.GetY(), 30.000000000000000, DELTA_MAX);
950 i++;
951 ASSERT_NEAR(segments[i].first.GetX(), 40.000000000000000, DELTA_MAX);
952 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
953 ASSERT_NEAR(segments[i].second.GetX(), 40.000000000000000, DELTA_MAX);
954 ASSERT_NEAR(segments[i].second.GetY(), 30.000000000000000, DELTA_MAX);
955 i++;
956 ASSERT_NEAR(segments[i].first.GetX(), 43.000000000000000, DELTA_MAX);
957 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
958 ASSERT_NEAR(segments[i].second.GetX(), 43.000000000000000, DELTA_MAX);
959 ASSERT_NEAR(segments[i].second.GetY(), 30.000000000000000, DELTA_MAX);
960 i++;
961 ASSERT_NEAR(segments[i].first.GetX(), 51.000000000000000, DELTA_MAX);
962 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
963 ASSERT_NEAR(segments[i].second.GetX(), 51.000000000000000, DELTA_MAX);
964 ASSERT_NEAR(segments[i].second.GetY(), 30.000000000000000, DELTA_MAX);
965 i++;
966 ASSERT_NEAR(segments[i].first.GetX(), 61.000000000000000, DELTA_MAX);
967 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
968 ASSERT_NEAR(segments[i].second.GetX(), 61.000000000000000, DELTA_MAX);
969 ASSERT_NEAR(segments[i].second.GetY(), 30.000000000000000, DELTA_MAX);
970 i++;
971 ASSERT_NEAR(segments[i].first.GetX(), 76.000000000000000, DELTA_MAX);
972 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
973 ASSERT_NEAR(segments[i].second.GetX(), 76.000000000000000, DELTA_MAX);
974 ASSERT_NEAR(segments[i].second.GetY(), 30.000000000000000, DELTA_MAX);
975 i++;
976 ASSERT_NEAR(segments[i].first.GetX(), 95.000000000000000, DELTA_MAX);
977 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
978 ASSERT_NEAR(segments[i].second.GetX(), 95.000000000000000, DELTA_MAX);
979 ASSERT_NEAR(segments[i].second.GetY(), 30.000000000000000, DELTA_MAX);
980 i++;
981 ASSERT_NEAR(segments[i].first.GetX(), 5.0000000000000000, DELTA_MAX);
982 ASSERT_NEAR(segments[i].first.GetY(), 0.0000000000000000, DELTA_MAX);
983 ASSERT_NEAR(segments[i].second.GetX(), 31.000000000000000, DELTA_MAX);
984 ASSERT_NEAR(segments[i].second.GetY(), 0.0000000000000000, DELTA_MAX);
985 i++;
986 ASSERT_NEAR(segments[i].first.GetX(), 36.000000000000000, DELTA_MAX);
987 ASSERT_NEAR(segments[i].first.GetY(), 0.0000000000000000, DELTA_MAX);
988 ASSERT_NEAR(segments[i].second.GetX(), 50.000000000000000, DELTA_MAX);
989 ASSERT_NEAR(segments[i].second.GetY(), 0.0000000000000000, DELTA_MAX);
990 i++;
991 ASSERT_NEAR(segments[i].first.GetX(), 5.0000000000000000, DELTA_MAX);
992 ASSERT_NEAR(segments[i].first.GetY(), 5.0000000000000000, DELTA_MAX);
993 ASSERT_NEAR(segments[i].second.GetX(), 20.000000000000000, DELTA_MAX);
994 ASSERT_NEAR(segments[i].second.GetY(), 5.0000000000000000, DELTA_MAX);
995 i++;
996 ASSERT_NEAR(segments[i].first.GetX(), 31.000000000000000, DELTA_MAX);
997 ASSERT_NEAR(segments[i].first.GetY(), 5.0000000000000000, DELTA_MAX);
998 ASSERT_NEAR(segments[i].second.GetX(), 36.000000000000000, DELTA_MAX);
999 ASSERT_NEAR(segments[i].second.GetY(), 5.0000000000000000, DELTA_MAX);
1000 i++;
1001 ASSERT_NEAR(segments[i].first.GetX(), 45.000000000000000, DELTA_MAX);
1002 ASSERT_NEAR(segments[i].first.GetY(), 5.0000000000000000, DELTA_MAX);
1003 ASSERT_NEAR(segments[i].second.GetX(), 50.000000000000000, DELTA_MAX);
1004 ASSERT_NEAR(segments[i].second.GetY(), 5.0000000000000000, DELTA_MAX);
1005 i++;
1006 ASSERT_NEAR(segments[i].first.GetX(), 52.000000000000000, DELTA_MAX);
1007 ASSERT_NEAR(segments[i].first.GetY(), 5.0000000000000000, DELTA_MAX);
1008 ASSERT_NEAR(segments[i].second.GetX(), 70.000000000000000, DELTA_MAX);
1009 ASSERT_NEAR(segments[i].second.GetY(), 5.0000000000000000, DELTA_MAX);
1010 i++;
1011 ASSERT_NEAR(segments[i].first.GetX(), 0.0000000000000000, DELTA_MAX);
1012 ASSERT_NEAR(segments[i].first.GetY(), 10.000000000000000, DELTA_MAX);
1013 ASSERT_NEAR(segments[i].second.GetX(), 20.000000000000000, DELTA_MAX);
1014 ASSERT_NEAR(segments[i].second.GetY(), 10.000000000000000, DELTA_MAX);
1015 i++;
1016 ASSERT_NEAR(segments[i].first.GetX(), 32.000000000000000, DELTA_MAX);
1017 ASSERT_NEAR(segments[i].first.GetY(), 10.000000000000000, DELTA_MAX);
1018 ASSERT_NEAR(segments[i].second.GetX(), 35.000000000000000, DELTA_MAX);
1019 ASSERT_NEAR(segments[i].second.GetY(), 10.000000000000000, DELTA_MAX);
1020 i++;
1021 ASSERT_NEAR(segments[i].first.GetX(), 44.000000000000000, DELTA_MAX);
1022 ASSERT_NEAR(segments[i].first.GetY(), 10.000000000000000, DELTA_MAX);
1023 ASSERT_NEAR(segments[i].second.GetX(), 45.000000000000000, DELTA_MAX);
1024 ASSERT_NEAR(segments[i].second.GetY(), 10.000000000000000, DELTA_MAX);
1025 i++;
1026 ASSERT_NEAR(segments[i].first.GetX(), 52.000000000000000, DELTA_MAX);
1027 ASSERT_NEAR(segments[i].first.GetY(), 10.000000000000000, DELTA_MAX);
1028 ASSERT_NEAR(segments[i].second.GetX(), 60.000000000000000, DELTA_MAX);
1029 ASSERT_NEAR(segments[i].second.GetY(), 10.000000000000000, DELTA_MAX);
1030 i++;
1031 ASSERT_NEAR(segments[i].first.GetX(), 70.000000000000000, DELTA_MAX);
1032 ASSERT_NEAR(segments[i].first.GetY(), 10.000000000000000, DELTA_MAX);
1033 ASSERT_NEAR(segments[i].second.GetX(), 75.000000000000000, DELTA_MAX);
1034 ASSERT_NEAR(segments[i].second.GetY(), 10.000000000000000, DELTA_MAX);
1035 i++;
1036 ASSERT_NEAR(segments[i].first.GetX(), 0.0000000000000000, DELTA_MAX);
1037 ASSERT_NEAR(segments[i].first.GetY(), 15.000000000000000, DELTA_MAX);
1038 ASSERT_NEAR(segments[i].second.GetX(), 10.000000000000000, DELTA_MAX);
1039 ASSERT_NEAR(segments[i].second.GetY(), 15.000000000000000, DELTA_MAX);
1040 i++;
1041 ASSERT_NEAR(segments[i].first.GetX(), 32.000000000000000, DELTA_MAX);
1042 ASSERT_NEAR(segments[i].first.GetY(), 15.000000000000000, DELTA_MAX);
1043 ASSERT_NEAR(segments[i].second.GetX(), 35.000000000000000, DELTA_MAX);
1044 ASSERT_NEAR(segments[i].second.GetY(), 15.000000000000000, DELTA_MAX);
1045 i++;
1046 ASSERT_NEAR(segments[i].first.GetX(), 41.000000000000000, DELTA_MAX);
1047 ASSERT_NEAR(segments[i].first.GetY(), 15.000000000000000, DELTA_MAX);
1048 ASSERT_NEAR(segments[i].second.GetX(), 44.000000000000000, DELTA_MAX);
1049 ASSERT_NEAR(segments[i].second.GetY(), 15.000000000000000, DELTA_MAX);
1050 i++;
1051 ASSERT_NEAR(segments[i].first.GetX(), 46.000000000000000, DELTA_MAX);
1052 ASSERT_NEAR(segments[i].first.GetY(), 15.000000000000000, DELTA_MAX);
1053 ASSERT_NEAR(segments[i].second.GetX(), 60.000000000000000, DELTA_MAX);
1054 ASSERT_NEAR(segments[i].second.GetY(), 15.000000000000000, DELTA_MAX);
1055 i++;
1056 ASSERT_NEAR(segments[i].first.GetX(), 75.000000000000000, DELTA_MAX);
1057 ASSERT_NEAR(segments[i].first.GetY(), 15.000000000000000, DELTA_MAX);
1058 ASSERT_NEAR(segments[i].second.GetX(), 80.000000000000000, DELTA_MAX);
1059 ASSERT_NEAR(segments[i].second.GetY(), 15.000000000000000, DELTA_MAX);
1060 i++;
1061 ASSERT_NEAR(segments[i].first.GetX(), 10.000000000000000, DELTA_MAX);
1062 ASSERT_NEAR(segments[i].first.GetY(), 20.000000000000000, DELTA_MAX);
1063 ASSERT_NEAR(segments[i].second.GetX(), 34.000000000000000, DELTA_MAX);
1064 ASSERT_NEAR(segments[i].second.GetY(), 20.000000000000000, DELTA_MAX);
1065 i++;
1066 ASSERT_NEAR(segments[i].first.GetX(), 41.000000000000000, DELTA_MAX);
1067 ASSERT_NEAR(segments[i].first.GetY(), 20.000000000000000, DELTA_MAX);
1068 ASSERT_NEAR(segments[i].second.GetX(), 42.000000000000000, DELTA_MAX);
1069 ASSERT_NEAR(segments[i].second.GetY(), 20.000000000000000, DELTA_MAX);
1070 i++;
1071 ASSERT_NEAR(segments[i].first.GetX(), 46.000000000000000, DELTA_MAX);
1072 ASSERT_NEAR(segments[i].first.GetY(), 20.000000000000000, DELTA_MAX);
1073 ASSERT_NEAR(segments[i].second.GetX(), 80.000000000000000, DELTA_MAX);
1074 ASSERT_NEAR(segments[i].second.GetY(), 20.000000000000000, DELTA_MAX);
1075 i++;
1076 ASSERT_NEAR(segments[i].first.GetX(), 90.000000000000000, DELTA_MAX);
1077 ASSERT_NEAR(segments[i].first.GetY(), 20.000000000000000, DELTA_MAX);
1078 ASSERT_NEAR(segments[i].second.GetX(), 96.000000000000000, DELTA_MAX);
1079 ASSERT_NEAR(segments[i].second.GetY(), 20.000000000000000, DELTA_MAX);
1080 i++;
1081 ASSERT_NEAR(segments[i].first.GetX(), 1.0000000000000000, DELTA_MAX);
1082 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
1083 ASSERT_NEAR(segments[i].second.GetX(), 33.000000000000000, DELTA_MAX);
1084 ASSERT_NEAR(segments[i].second.GetY(), 25.000000000000000, DELTA_MAX);
1085 i++;
1086 ASSERT_NEAR(segments[i].first.GetX(), 34.000000000000000, DELTA_MAX);
1087 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
1088 ASSERT_NEAR(segments[i].second.GetX(), 40.000000000000000, DELTA_MAX);
1089 ASSERT_NEAR(segments[i].second.GetY(), 25.000000000000000, DELTA_MAX);
1090 i++;
1091 ASSERT_NEAR(segments[i].first.GetX(), 42.000000000000000, DELTA_MAX);
1092 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
1093 ASSERT_NEAR(segments[i].second.GetX(), 43.000000000000000, DELTA_MAX);
1094 ASSERT_NEAR(segments[i].second.GetY(), 25.000000000000000, DELTA_MAX);
1095 i++;
1096 ASSERT_NEAR(segments[i].first.GetX(), 51.000000000000000, DELTA_MAX);
1097 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
1098 ASSERT_NEAR(segments[i].second.GetX(), 61.000000000000000, DELTA_MAX);
1099 ASSERT_NEAR(segments[i].second.GetY(), 25.000000000000000, DELTA_MAX);
1100 i++;
1101 ASSERT_NEAR(segments[i].first.GetX(), 76.000000000000000, DELTA_MAX);
1102 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
1103 ASSERT_NEAR(segments[i].second.GetX(), 90.000000000000000, DELTA_MAX);
1104 ASSERT_NEAR(segments[i].second.GetY(), 25.000000000000000, DELTA_MAX);
1105 i++;
1106 ASSERT_NEAR(segments[i].first.GetX(), 95.000000000000000, DELTA_MAX);
1107 ASSERT_NEAR(segments[i].first.GetY(), 25.000000000000000, DELTA_MAX);
1108 ASSERT_NEAR(segments[i].second.GetX(), 96.000000000000000, DELTA_MAX);
1109 ASSERT_NEAR(segments[i].second.GetY(), 25.000000000000000, DELTA_MAX);
1110 i++;
1111 ASSERT_NEAR(segments[i].first.GetX(), 1.0000000000000000, DELTA_MAX);
1112 ASSERT_NEAR(segments[i].first.GetY(), 30.000000000000000, DELTA_MAX);
1113 ASSERT_NEAR(segments[i].second.GetX(), 33.000000000000000, DELTA_MAX);
1114 ASSERT_NEAR(segments[i].second.GetY(), 30.000000000000000, DELTA_MAX);
1115 i++;
1116 ASSERT_NEAR(segments[i].first.GetX(), 40.000000000000000, DELTA_MAX);
1117 ASSERT_NEAR(segments[i].first.GetY(), 30.000000000000000, DELTA_MAX);
1118 ASSERT_NEAR(segments[i].second.GetX(), 43.000000000000000, DELTA_MAX);
1119 ASSERT_NEAR(segments[i].second.GetY(), 30.000000000000000, DELTA_MAX);
1120 i++;
1121 ASSERT_NEAR(segments[i].first.GetX(), 51.000000000000000, DELTA_MAX);
1122 ASSERT_NEAR(segments[i].first.GetY(), 30.000000000000000, DELTA_MAX);
1123 ASSERT_NEAR(segments[i].second.GetX(), 61.000000000000000, DELTA_MAX);
1124 ASSERT_NEAR(segments[i].second.GetY(), 30.000000000000000, DELTA_MAX);
1125 i++;
1126 ASSERT_NEAR(segments[i].first.GetX(), 76.000000000000000, DELTA_MAX);
1127 ASSERT_NEAR(segments[i].first.GetY(), 30.000000000000000, DELTA_MAX);
1128 ASSERT_NEAR(segments[i].second.GetX(), 95.000000000000000, DELTA_MAX);
1129 ASSERT_NEAR(segments[i].second.GetY(), 30.000000000000000, DELTA_MAX);
1130 }
1131
1132 #if defined(BGO_ENABLE_DICOMSTRUCTURESETLOADER2) && (ORTHANC_SANDBOXED != 1)
1133
1134 #include <SystemToolbox.h>
1135
1136 TEST(StructureSet2, ReadFromJsonPart2)
1137 {
1138 DicomStructureSet2 structureSet;
1139 std::string jsonText;
1140
1141 Orthanc::SystemToolbox::ReadFile(jsonText, "72c773ac-5059f2c4-2e6a9120-4fd4bca1-45701661.json");
1142
1143 FullOrthancDataset dicom(jsonText);
1144 structureSet.Clear();
1145
1146 structureSet.FillStructuresFromDataset(dicom);
1147 structureSet.ComputeDependentProperties();
1148
1149 //const std::vector<DicomStructure2>& structures = structureSet.structures_;
1150 }
1151
1152 #endif
1153 // BGO_ENABLE_DICOMSTRUCTURESETLOADER2
1154
1155