orthanc: OrthancServer/SliceOrdering.cpp comparison

better handling of ordered-slices

author	Sebastien Jodogne <s.jodogne@gmail.com>
date	Mon, 30 Nov 2015 13:16:52 +0100
parents	ec66a16aa398
children	1ba224001fd0

comparison

equal deleted inserted replaced

-:5d8134e54c03
+:697ae8d0e287
 }
 PositionComparator comparator(normal_);
 std::sort(instances_.begin(), instances_.end(), comparator);
-float a = instances_.front()->ComputeRelativePosition(normal_);
+float a = instances_[0]->ComputeRelativePosition(normal_);
-float b = instances_.back()->ComputeRelativePosition(normal_);
+for (size_t i = 1; i < instances_.size(); i++)
+{
-if (std::fabs(b - a) <= 10.0f * std::numeric_limits<float>::epsilon())
+float b = instances_[i]->ComputeRelativePosition(normal_);
-{
-// Not enough difference between the minimum and maximum
+if (std::fabs(b - a) <= 10.0f * std::numeric_limits<float>::epsilon())
-// positions along the normal of the volume
+{
-return false;
+// Not enough space between two slices along the normal of the volume
-}
+printf("Not enough space\n");
-else
+return false;
-{
+}
-// This is a 3D volume
-isVolume_ = true;
+a = b;
-return true;
+}
-}
+// This is a 3D volume
+isVolume_ = true;
+return true;
 }
 bool SliceOrdering::SortUsingIndexInSeries()
 {

Mercurial > hg > orthanc