|
0
|
1 /**
|
|
|
2 * Stone of Orthanc
|
|
|
3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics
|
|
|
4 * Department, University Hospital of Liege, Belgium
|
|
|
5 *
|
|
|
6 * This program is free software: you can redistribute it and/or
|
|
|
7 * modify it under the terms of the GNU General Public License as
|
|
|
8 * published by the Free Software Foundation, either version 3 of the
|
|
|
9 * License, or (at your option) any later version.
|
|
|
10 *
|
|
|
11 * In addition, as a special exception, the copyright holders of this
|
|
|
12 * program give permission to link the code of its release with the
|
|
|
13 * OpenSSL project's "OpenSSL" library (or with modified versions of it
|
|
|
14 * that use the same license as the "OpenSSL" library), and distribute
|
|
|
15 * the linked executables. You must obey the GNU General Public License
|
|
|
16 * in all respects for all of the code used other than "OpenSSL". If you
|
|
|
17 * modify file(s) with this exception, you may extend this exception to
|
|
|
18 * your version of the file(s), but you are not obligated to do so. If
|
|
|
19 * you do not wish to do so, delete this exception statement from your
|
|
|
20 * version. If you delete this exception statement from all source files
|
|
|
21 * in the program, then also delete it here.
|
|
|
22 *
|
|
|
23 * This program is distributed in the hope that it will be useful, but
|
|
|
24 * WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
25 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
26 * General Public License for more details.
|
|
|
27 *
|
|
|
28 * You should have received a copy of the GNU General Public License
|
|
|
29 * along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
30 **/
|
|
|
31
|
|
|
32
|
|
|
33 #include "ParallelSlices.h"
|
|
|
34
|
|
16
|
35 #include "../../Resources/Orthanc/Core/Logging.h"
|
|
|
36 #include "../../Resources/Orthanc/Core/OrthancException.h"
|
|
0
|
37
|
|
|
38 namespace OrthancStone
|
|
|
39 {
|
|
|
40 ParallelSlices::ParallelSlices()
|
|
|
41 {
|
|
|
42 GeometryToolbox::AssignVector(normal_, 0, 0, 1);
|
|
|
43 }
|
|
|
44
|
|
|
45
|
|
|
46 ParallelSlices::ParallelSlices(const ParallelSlices& other)
|
|
|
47 {
|
|
|
48 normal_ = other.normal_;
|
|
|
49
|
|
|
50 slices_.resize(other.slices_.size());
|
|
|
51
|
|
|
52 for (size_t i = 0; i < slices_.size(); i++)
|
|
|
53 {
|
|
|
54 assert(other.slices_[i] != NULL);
|
|
|
55 slices_[i] = new SliceGeometry(*other.slices_[i]);
|
|
|
56 }
|
|
|
57 }
|
|
|
58
|
|
|
59
|
|
|
60 ParallelSlices::~ParallelSlices()
|
|
|
61 {
|
|
|
62 for (size_t i = 0; i < slices_.size(); i++)
|
|
|
63 {
|
|
|
64 if (slices_[i] != NULL)
|
|
|
65 {
|
|
|
66 delete slices_[i];
|
|
|
67 slices_[i] = NULL;
|
|
|
68 }
|
|
|
69 }
|
|
|
70 }
|
|
|
71
|
|
|
72
|
|
|
73 void ParallelSlices::AddSlice(const SliceGeometry& slice)
|
|
|
74 {
|
|
|
75 if (slices_.empty())
|
|
|
76 {
|
|
|
77 normal_ = slice.GetNormal();
|
|
|
78 slices_.push_back(new SliceGeometry(slice));
|
|
|
79 }
|
|
|
80 else if (GeometryToolbox::IsParallel(slice.GetNormal(), normal_))
|
|
|
81 {
|
|
|
82 slices_.push_back(new SliceGeometry(slice));
|
|
|
83 }
|
|
|
84 else
|
|
|
85 {
|
|
|
86 LOG(ERROR) << "Trying to add a slice that is not parallel to the previous ones";
|
|
|
87 throw Orthanc::OrthancException(Orthanc::ErrorCode_BadSequenceOfCalls);
|
|
|
88 }
|
|
|
89 }
|
|
|
90
|
|
|
91
|
|
|
92 void ParallelSlices::AddSlice(const Vector& origin,
|
|
|
93 const Vector& axisX,
|
|
|
94 const Vector& axisY)
|
|
|
95 {
|
|
|
96 SliceGeometry slice(origin, axisX, axisY);
|
|
|
97 AddSlice(slice);
|
|
|
98 }
|
|
|
99
|
|
|
100
|
|
|
101 const SliceGeometry& ParallelSlices::GetSlice(size_t index) const
|
|
|
102 {
|
|
|
103 if (index >= slices_.size())
|
|
|
104 {
|
|
|
105 throw Orthanc::OrthancException(Orthanc::ErrorCode_ParameterOutOfRange);
|
|
|
106 }
|
|
|
107 else
|
|
|
108 {
|
|
|
109 return *slices_[index];
|
|
|
110 }
|
|
|
111 }
|
|
|
112
|
|
|
113
|
|
|
114 bool ParallelSlices::ComputeClosestSlice(size_t& closestSlice,
|
|
|
115 double& closestDistance,
|
|
|
116 const Vector& origin) const
|
|
|
117 {
|
|
|
118 if (slices_.empty())
|
|
|
119 {
|
|
|
120 return false;
|
|
|
121 }
|
|
|
122
|
|
|
123 double reference = boost::numeric::ublas::inner_prod(origin, normal_);
|
|
|
124
|
|
|
125 closestSlice = 0;
|
|
|
126 closestDistance = std::numeric_limits<double>::infinity();
|
|
|
127
|
|
|
128 for (size_t i = 0; i < slices_.size(); i++)
|
|
|
129 {
|
|
|
130 double distance = fabs(boost::numeric::ublas::inner_prod(slices_[i]->GetOrigin(), normal_) - reference);
|
|
|
131
|
|
|
132 if (distance < closestDistance)
|
|
|
133 {
|
|
|
134 closestSlice = i;
|
|
|
135 closestDistance = distance;
|
|
|
136 }
|
|
|
137 }
|
|
|
138
|
|
|
139 return true;
|
|
|
140 }
|
|
|
141
|
|
|
142
|
|
|
143 ParallelSlices* ParallelSlices::Reverse() const
|
|
|
144 {
|
|
|
145 std::auto_ptr<ParallelSlices> reversed(new ParallelSlices);
|
|
|
146
|
|
|
147 for (size_t i = slices_.size(); i > 0; i--)
|
|
|
148 {
|
|
|
149 const SliceGeometry& slice = *slices_[i - 1];
|
|
|
150
|
|
|
151 reversed->AddSlice(slice.GetOrigin(),
|
|
|
152 -slice.GetAxisX(),
|
|
|
153 slice.GetAxisY());
|
|
|
154 }
|
|
|
155
|
|
|
156 return reversed.release();
|
|
|
157 }
|
|
|
158 }
|
