#ifndef SGVec3_H
#define SGVec3_H
+#include <osg/Vec3f>
+#include <osg/Vec3d>
+
+template<typename T>
+struct SGVec3Storage {
+ /// Readonly raw storage interface
+ const T (&data(void) const)[3]
+ { return _data; }
+ /// Readonly raw storage interface
+ T (&data(void))[3]
+ { return _data; }
+
+ void osg() const
+ { }
+
+private:
+ T _data[3];
+};
+
+template<>
+struct SGVec3Storage<float> : public osg::Vec3f {
+ /// Access raw data by index, the index is unchecked
+ const float (&data(void) const)[3]
+ { return osg::Vec3f::_v; }
+ /// Access raw data by index, the index is unchecked
+ float (&data(void))[3]
+ { return osg::Vec3f::_v; }
+
+ const osg::Vec3f& osg() const
+ { return *this; }
+ osg::Vec3f& osg()
+ { return *this; }
+};
+
+template<>
+struct SGVec3Storage<double> : public osg::Vec3d {
+ /// Access raw data by index, the index is unchecked
+ const double (&data(void) const)[3]
+ { return osg::Vec3d::_v; }
+ /// Access raw data by index, the index is unchecked
+ double (&data(void))[3]
+ { return osg::Vec3d::_v; }
+
+ const osg::Vec3d& osg() const
+ { return *this; }
+ osg::Vec3d& osg()
+ { return *this; }
+};
+
/// 3D Vector Class
template<typename T>
-class SGVec3 {
+class SGVec3 : protected SGVec3Storage<T> {
public:
typedef T value_type;
/// uninitialized values in the debug build very fast ...
#ifndef NDEBUG
for (unsigned i = 0; i < 3; ++i)
- _data[i] = SGLimits<T>::quiet_NaN();
+ data()[i] = SGLimits<T>::quiet_NaN();
#endif
}
/// Constructor. Initialize by the given values
SGVec3(T x, T y, T z)
- { _data[0] = x; _data[1] = y; _data[2] = z; }
+ { data()[0] = x; data()[1] = y; data()[2] = z; }
/// Constructor. Initialize by the content of a plain array,
/// make sure it has at least 3 elements
- explicit SGVec3(const T* data)
- { _data[0] = data[0]; _data[1] = data[1]; _data[2] = data[2]; }
+ explicit SGVec3(const T* d)
+ { data()[0] = d[0]; data()[1] = d[1]; data()[2] = d[2]; }
+ template<typename S>
+ explicit SGVec3(const SGVec3<S>& d)
+ { data()[0] = d[0]; data()[1] = d[1]; data()[2] = d[2]; }
+ explicit SGVec3(const osg::Vec3f& d)
+ { data()[0] = d[0]; data()[1] = d[1]; data()[2] = d[2]; }
+ explicit SGVec3(const osg::Vec3d& d)
+ { data()[0] = d[0]; data()[1] = d[1]; data()[2] = d[2]; }
+ explicit SGVec3(const SGVec2<T>& v2, const T& v3 = 0)
+ { data()[0] = v2[0]; data()[1] = v2[1]; data()[2] = v3; }
/// Access by index, the index is unchecked
const T& operator()(unsigned i) const
- { return _data[i]; }
+ { return data()[i]; }
/// Access by index, the index is unchecked
T& operator()(unsigned i)
- { return _data[i]; }
+ { return data()[i]; }
/// Access raw data by index, the index is unchecked
const T& operator[](unsigned i) const
- { return _data[i]; }
+ { return data()[i]; }
/// Access raw data by index, the index is unchecked
T& operator[](unsigned i)
- { return _data[i]; }
+ { return data()[i]; }
/// Access the x component
const T& x(void) const
- { return _data[0]; }
+ { return data()[0]; }
/// Access the x component
T& x(void)
- { return _data[0]; }
+ { return data()[0]; }
/// Access the y component
const T& y(void) const
- { return _data[1]; }
+ { return data()[1]; }
/// Access the y component
T& y(void)
- { return _data[1]; }
+ { return data()[1]; }
/// Access the z component
const T& z(void) const
- { return _data[2]; }
+ { return data()[2]; }
/// Access the z component
T& z(void)
- { return _data[2]; }
+ { return data()[2]; }
/// Get the data pointer
- const T* data(void) const
- { return _data; }
- /// Get the data pointer
- T* data(void)
- { return _data; }
+ using SGVec3Storage<T>::data;
/// Readonly interface function to ssg's sgVec3/sgdVec3
const T (&sg(void) const)[3]
- { return _data; }
+ { return data(); }
/// Interface function to ssg's sgVec3/sgdVec3
T (&sg(void))[3]
- { return _data; }
+ { return data(); }
+
+ /// Interface function to osg's Vec3*
+ using SGVec3Storage<T>::osg;
/// Inplace addition
SGVec3& operator+=(const SGVec3& v)
- { _data[0] += v(0); _data[1] += v(1); _data[2] += v(2); return *this; }
+ { data()[0] += v(0); data()[1] += v(1); data()[2] += v(2); return *this; }
/// Inplace subtraction
SGVec3& operator-=(const SGVec3& v)
- { _data[0] -= v(0); _data[1] -= v(1); _data[2] -= v(2); return *this; }
+ { data()[0] -= v(0); data()[1] -= v(1); data()[2] -= v(2); return *this; }
/// Inplace scalar multiplication
template<typename S>
SGVec3& operator*=(S s)
- { _data[0] *= s; _data[1] *= s; _data[2] *= s; return *this; }
+ { data()[0] *= s; data()[1] *= s; data()[2] *= s; return *this; }
/// Inplace scalar multiplication by 1/s
template<typename S>
SGVec3& operator/=(S s)
/// Constructor. Initialize by a geocentric coordinate
/// Note that this conversion is relatively expensive to compute
static SGVec3 fromGeoc(const SGGeoc& geoc);
-
-private:
- /// The actual data
- T _data[3];
};
template<>
operator*(const SGVec3<T>& v, S s)
{ return SGVec3<T>(s*v(0), s*v(1), s*v(2)); }
+/// multiplication as a multiplicator, that is assume that the first vector
+/// represents a 3x3 diagonal matrix with the diagonal elements in the vector.
+/// Then the result is the product of that matrix times the second vector.
+template<typename T>
+inline
+SGVec3<T>
+mult(const SGVec3<T>& v1, const SGVec3<T>& v2)
+{ return SGVec3<T>(v1(0)*v2(0), v1(1)*v2(1), v1(2)*v2(2)); }
+
+/// component wise min
+template<typename T>
+inline
+SGVec3<T>
+min(const SGVec3<T>& v1, const SGVec3<T>& v2)
+{
+ return SGVec3<T>(SGMisc<T>::min(v1(0), v2(0)),
+ SGMisc<T>::min(v1(1), v2(1)),
+ SGMisc<T>::min(v1(2), v2(2)));
+}
+template<typename S, typename T>
+inline
+SGVec3<T>
+min(const SGVec3<T>& v, S s)
+{
+ return SGVec3<T>(SGMisc<T>::min(s, v(0)),
+ SGMisc<T>::min(s, v(1)),
+ SGMisc<T>::min(s, v(2)));
+}
+template<typename S, typename T>
+inline
+SGVec3<T>
+min(S s, const SGVec3<T>& v)
+{
+ return SGVec3<T>(SGMisc<T>::min(s, v(0)),
+ SGMisc<T>::min(s, v(1)),
+ SGMisc<T>::min(s, v(2)));
+}
+
+/// component wise max
+template<typename T>
+inline
+SGVec3<T>
+max(const SGVec3<T>& v1, const SGVec3<T>& v2)
+{
+ return SGVec3<T>(SGMisc<T>::max(v1(0), v2(0)),
+ SGMisc<T>::max(v1(1), v2(1)),
+ SGMisc<T>::max(v1(2), v2(2)));
+}
+template<typename S, typename T>
+inline
+SGVec3<T>
+max(const SGVec3<T>& v, S s)
+{
+ return SGVec3<T>(SGMisc<T>::max(s, v(0)),
+ SGMisc<T>::max(s, v(1)),
+ SGMisc<T>::max(s, v(2)));
+}
+template<typename S, typename T>
+inline
+SGVec3<T>
+max(S s, const SGVec3<T>& v)
+{
+ return SGVec3<T>(SGMisc<T>::max(s, v(0)),
+ SGMisc<T>::max(s, v(1)),
+ SGMisc<T>::max(s, v(2)));
+}
+
/// Scalar dot product
template<typename T>
inline
norm1(const SGVec3<T>& v)
{ return fabs(v(0)) + fabs(v(1)) + fabs(v(2)); }
+/// The inf-norm of the vector
+template<typename T>
+inline
+T
+normI(const SGVec3<T>& v)
+{ return SGMisc<T>::max(fabs(v(0)), fabs(v(1)), fabs(v(2))); }
+
/// Vector cross product
template<typename T>
inline
v1(0)*v2(1) - v1(1)*v2(0));
}
+/// return any normalized vector perpendicular to v
+template<typename T>
+inline
+SGVec3<T>
+perpendicular(const SGVec3<T>& v)
+{
+ T absv1 = fabs(v(0));
+ T absv2 = fabs(v(1));
+ T absv3 = fabs(v(2));
+
+ if (absv2 < absv1 && absv3 < absv1) {
+ T quot = v(1)/v(0);
+ return (1/sqrt(1+quot*quot))*SGVec3<T>(quot, -1, 0);
+ } else if (absv3 < absv2) {
+ T quot = v(2)/v(1);
+ return (1/sqrt(1+quot*quot))*SGVec3<T>(0, quot, -1);
+ } else if (SGLimits<T>::min() < absv3) {
+ T quot = v(0)/v(2);
+ return (1/sqrt(1+quot*quot))*SGVec3<T>(-1, 0, quot);
+ } else {
+ // the all zero case ...
+ return SGVec3<T>(0, 0, 0);
+ }
+}
+
/// The euclidean norm of the vector, that is what most people call length
template<typename T>
inline
operator!=(const SGVec3<T>& v1, const SGVec3<T>& v2)
{ return ! (v1 == v2); }
+/// Return true if smaller, good for putting that into a std::map
+template<typename T>
+inline
+bool
+operator<(const SGVec3<T>& v1, const SGVec3<T>& v2)
+{
+ if (v1(0) < v2(0)) return true;
+ else if (v2(0) < v1(0)) return false;
+ else if (v1(1) < v2(1)) return true;
+ else if (v2(1) < v1(1)) return false;
+ else return (v1(2) < v2(2));
+}
+
+template<typename T>
+inline
+bool
+operator<=(const SGVec3<T>& v1, const SGVec3<T>& v2)
+{
+ if (v1(0) < v2(0)) return true;
+ else if (v2(0) < v1(0)) return false;
+ else if (v1(1) < v2(1)) return true;
+ else if (v2(1) < v1(1)) return false;
+ else return (v1(2) <= v2(2));
+}
+
+template<typename T>
+inline
+bool
+operator>(const SGVec3<T>& v1, const SGVec3<T>& v2)
+{ return operator<(v2, v1); }
+
+template<typename T>
+inline
+bool
+operator>=(const SGVec3<T>& v1, const SGVec3<T>& v2)
+{ return operator<=(v2, v1); }
+
/// Return true if equal to the relative tolerance tol
template<typename T>
inline