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
|
/*=========================================================================
Program: GDCM (Grassroots DICOM). A DICOM library
Copyright (c) 2006-2011 Mathieu Malaterre
All rights reserved.
See Copyright.txt or http://gdcm.sourceforge.net/Copyright.html for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
#include "gdcmDirectionCosines.h"
#include <limits>
#include <math.h> // fabs
#include <stdio.h> // sscanf
namespace gdcm
{
DirectionCosines::DirectionCosines()
{
Values[0] = 1;
Values[1] = 0;
Values[2] = 0;
Values[3] = 0;
Values[4] = 1;
Values[5] = 0;
}
DirectionCosines::DirectionCosines(const double dircos[6])
{
Values[0] = dircos[0];
Values[1] = dircos[1];
Values[2] = dircos[2];
Values[3] = dircos[3];
Values[4] = dircos[4];
Values[5] = dircos[5];
}
DirectionCosines::~DirectionCosines() = default;
void DirectionCosines::Print(std::ostream &os) const
{
os << Values[0] << ",";
os << Values[1] << ",";
os << Values[2] << ",";
os << Values[3] << ",";
os << Values[4] << ",";
os << Values[5];
}
bool DirectionCosines::IsValid() const
{
// gdcmData/gdcm-MR-SIEMENS-16-2.acr
// => {-1, -0, 0, -0, 0.05233599990606308, 0.99862951040267944}
const double epsilon = 1e-3; //std::numeric_limits<double>::epsilon();
double norm_v1 = Values[0] * Values[0] + Values[1]*Values[1] + Values[2]*Values[2];
double norm_v2 = Values[3] * Values[3] + Values[4]*Values[4] + Values[5]*Values[5];
double dot = Dot();
bool ret = false;
if( fabs(norm_v1 - 1) < epsilon && fabs(norm_v2 - 1) < epsilon )
{
if( fabs(dot) < epsilon )
{
ret = true;
}
}
return ret;
}
void DirectionCosines::Cross(double z[3]) const
{
//assert( Dot() == 0 );
const double *x = Values;
const double *y = x+3;
double Zx = x[1]*y[2] - x[2]*y[1];
double Zy = x[2]*y[0] - x[0]*y[2];
double Zz = x[0]*y[1] - x[1]*y[0];
z[0] = Zx; z[1] = Zy; z[2] = Zz;
}
static inline double DotImpl(const double x[3], const double y[3])
{
return x[0]*y[0] + x[1]*y[1] + x[2]*y[2];
}
double DirectionCosines::Dot(const double x[3], const double y[3])
{
return DotImpl(x, y);
}
double DirectionCosines::Dot() const
{
return DotImpl(Values, Values+3);
}
// static function is within gdcm:: namespace, so should not pollute too much on UNIX
static inline double Norm(const double x[3])
{
return sqrt(x[0]*x[0] + x[1]*x[1] + x[2]*x[2]);
}
void DirectionCosines::Normalize(double v[3])
{
double den;
if ( (den = Norm(v)) != 0.0 )
{
for (int i=0; i < 3; i++)
{
v[i] /= den;
}
}
}
void DirectionCosines::Normalize()
{
double *x = Values;
double den;
if ( (den = Norm(x)) != 0.0 )
{
for (int i=0; i < 3; i++)
{
x[i] /= den;
}
}
x = Values+3;
if ( (den = Norm(x)) != 0.0 )
{
for (int i=0; i < 3; i++)
{
x[i] /= den;
}
}
}
bool DirectionCosines::SetFromString(const char *str)
{
if( str )
{
const int n = sscanf( str, R"(%lf\%lf\%lf\%lf\%lf\%lf)",
Values, Values+1, Values+2, Values+3, Values+4, Values+5 );
if( n == 6 )
{
return true;
}
}
// else
Values[0] = 1;
Values[1] = 0;
Values[2] = 0;
Values[3] = 0;
Values[4] = 1;
Values[5] = 0;
return false;
}
double DirectionCosines::CrossDot(DirectionCosines const &dc) const
{
double z1[3];
Cross(z1);
double z2[3];
dc.Cross(z2);
const double *x = z1;
const double *y = z2;
return x[0]*y[0] + x[1]*y[1] + x[2]*y[2];
}
double DirectionCosines::ComputeDistAlongNormal(const double ipp[3]) const
{
double normal[3];
Cross(normal);
double dist = 0.;
for (int i = 0; i < 3; ++i) dist += normal[i]*ipp[i];
return dist;
}
} // end namespace gdcm
|