Collection of DPF-based plugins for packaging
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

356 lines
10KB

  1. /// @ref gtx_dual_quaternion
  2. /// @file glm/gtx/dual_quaternion.inl
  3. #include "../geometric.hpp"
  4. #include <limits>
  5. namespace glm
  6. {
  7. // -- Component accesses --
  8. template<typename T, qualifier Q>
  9. GLM_FUNC_QUALIFIER typename tdualquat<T, Q>::part_type & tdualquat<T, Q>::operator[](typename tdualquat<T, Q>::length_type i)
  10. {
  11. assert(i >= 0 && i < this->length());
  12. return (&real)[i];
  13. }
  14. template<typename T, qualifier Q>
  15. GLM_FUNC_QUALIFIER typename tdualquat<T, Q>::part_type const& tdualquat<T, Q>::operator[](typename tdualquat<T, Q>::length_type i) const
  16. {
  17. assert(i >= 0 && i < this->length());
  18. return (&real)[i];
  19. }
  20. // -- Implicit basic constructors --
  21. # if !GLM_HAS_DEFAULTED_FUNCTIONS || defined(GLM_FORCE_CTOR_INIT)
  22. template<typename T, qualifier Q>
  23. GLM_FUNC_QUALIFIER GLM_CONSTEXPR tdualquat<T, Q>::tdualquat()
  24. # ifdef GLM_FORCE_CTOR_INIT
  25. : real(tquat<T, Q>())
  26. , dual(tquat<T, Q>(0, 0, 0, 0))
  27. # endif
  28. {}
  29. # endif
  30. # if !GLM_HAS_DEFAULTED_FUNCTIONS
  31. template<typename T, qualifier Q>
  32. GLM_FUNC_QUALIFIER GLM_CONSTEXPR tdualquat<T, Q>::tdualquat(tdualquat<T, Q> const& d)
  33. : real(d.real)
  34. , dual(d.dual)
  35. {}
  36. # endif//!GLM_HAS_DEFAULTED_FUNCTIONS
  37. template<typename T, qualifier Q>
  38. template<qualifier P>
  39. GLM_FUNC_QUALIFIER GLM_CONSTEXPR tdualquat<T, Q>::tdualquat(tdualquat<T, P> const& d)
  40. : real(d.real)
  41. , dual(d.dual)
  42. {}
  43. // -- Explicit basic constructors --
  44. template<typename T, qualifier Q>
  45. GLM_FUNC_QUALIFIER GLM_CONSTEXPR tdualquat<T, Q>::tdualquat(tquat<T, Q> const& r)
  46. : real(r), dual(tquat<T, Q>(0, 0, 0, 0))
  47. {}
  48. template<typename T, qualifier Q>
  49. GLM_FUNC_QUALIFIER GLM_CONSTEXPR tdualquat<T, Q>::tdualquat(tquat<T, Q> const& q, vec<3, T, Q> const& p)
  50. : real(q), dual(
  51. T(-0.5) * ( p.x*q.x + p.y*q.y + p.z*q.z),
  52. T(+0.5) * ( p.x*q.w + p.y*q.z - p.z*q.y),
  53. T(+0.5) * (-p.x*q.z + p.y*q.w + p.z*q.x),
  54. T(+0.5) * ( p.x*q.y - p.y*q.x + p.z*q.w))
  55. {}
  56. template<typename T, qualifier Q>
  57. GLM_FUNC_QUALIFIER GLM_CONSTEXPR tdualquat<T, Q>::tdualquat(tquat<T, Q> const& r, tquat<T, Q> const& d)
  58. : real(r), dual(d)
  59. {}
  60. // -- Conversion constructors --
  61. template<typename T, qualifier Q>
  62. template<typename U, qualifier P>
  63. GLM_FUNC_QUALIFIER GLM_CONSTEXPR tdualquat<T, Q>::tdualquat(tdualquat<U, P> const& q)
  64. : real(q.real)
  65. , dual(q.dual)
  66. {}
  67. template<typename T, qualifier Q>
  68. GLM_FUNC_QUALIFIER tdualquat<T, Q>::tdualquat(mat<2, 4, T, Q> const& m)
  69. {
  70. *this = dualquat_cast(m);
  71. }
  72. template<typename T, qualifier Q>
  73. GLM_FUNC_QUALIFIER tdualquat<T, Q>::tdualquat(mat<3, 4, T, Q> const& m)
  74. {
  75. *this = dualquat_cast(m);
  76. }
  77. // -- Unary arithmetic operators --
  78. # if !GLM_HAS_DEFAULTED_FUNCTIONS
  79. template<typename T, qualifier Q>
  80. GLM_FUNC_QUALIFIER tdualquat<T, Q> & tdualquat<T, Q>::operator=(tdualquat<T, Q> const& q)
  81. {
  82. this->real = q.real;
  83. this->dual = q.dual;
  84. return *this;
  85. }
  86. # endif//!GLM_HAS_DEFAULTED_FUNCTIONS
  87. template<typename T, qualifier Q>
  88. template<typename U>
  89. GLM_FUNC_QUALIFIER tdualquat<T, Q> & tdualquat<T, Q>::operator=(tdualquat<U, Q> const& q)
  90. {
  91. this->real = q.real;
  92. this->dual = q.dual;
  93. return *this;
  94. }
  95. template<typename T, qualifier Q>
  96. template<typename U>
  97. GLM_FUNC_QUALIFIER tdualquat<T, Q> & tdualquat<T, Q>::operator*=(U s)
  98. {
  99. this->real *= static_cast<T>(s);
  100. this->dual *= static_cast<T>(s);
  101. return *this;
  102. }
  103. template<typename T, qualifier Q>
  104. template<typename U>
  105. GLM_FUNC_QUALIFIER tdualquat<T, Q> & tdualquat<T, Q>::operator/=(U s)
  106. {
  107. this->real /= static_cast<T>(s);
  108. this->dual /= static_cast<T>(s);
  109. return *this;
  110. }
  111. // -- Unary bit operators --
  112. template<typename T, qualifier Q>
  113. GLM_FUNC_QUALIFIER tdualquat<T, Q> operator+(tdualquat<T, Q> const& q)
  114. {
  115. return q;
  116. }
  117. template<typename T, qualifier Q>
  118. GLM_FUNC_QUALIFIER tdualquat<T, Q> operator-(tdualquat<T, Q> const& q)
  119. {
  120. return tdualquat<T, Q>(-q.real, -q.dual);
  121. }
  122. // -- Binary operators --
  123. template<typename T, qualifier Q>
  124. GLM_FUNC_QUALIFIER tdualquat<T, Q> operator+(tdualquat<T, Q> const& q, tdualquat<T, Q> const& p)
  125. {
  126. return tdualquat<T, Q>(q.real + p.real,q.dual + p.dual);
  127. }
  128. template<typename T, qualifier Q>
  129. GLM_FUNC_QUALIFIER tdualquat<T, Q> operator*(tdualquat<T, Q> const& p, tdualquat<T, Q> const& o)
  130. {
  131. return tdualquat<T, Q>(p.real * o.real,p.real * o.dual + p.dual * o.real);
  132. }
  133. template<typename T, qualifier Q>
  134. GLM_FUNC_QUALIFIER vec<3, T, Q> operator*(tdualquat<T, Q> const& q, vec<3, T, Q> const& v)
  135. {
  136. vec<3, T, Q> const real_v3(q.real.x,q.real.y,q.real.z);
  137. vec<3, T, Q> const dual_v3(q.dual.x,q.dual.y,q.dual.z);
  138. return (cross(real_v3, cross(real_v3,v) + v * q.real.w + dual_v3) + dual_v3 * q.real.w - real_v3 * q.dual.w) * T(2) + v;
  139. }
  140. template<typename T, qualifier Q>
  141. GLM_FUNC_QUALIFIER vec<3, T, Q> operator*(vec<3, T, Q> const& v, tdualquat<T, Q> const& q)
  142. {
  143. return glm::inverse(q) * v;
  144. }
  145. template<typename T, qualifier Q>
  146. GLM_FUNC_QUALIFIER vec<4, T, Q> operator*(tdualquat<T, Q> const& q, vec<4, T, Q> const& v)
  147. {
  148. return vec<4, T, Q>(q * vec<3, T, Q>(v), v.w);
  149. }
  150. template<typename T, qualifier Q>
  151. GLM_FUNC_QUALIFIER vec<4, T, Q> operator*(vec<4, T, Q> const& v, tdualquat<T, Q> const& q)
  152. {
  153. return glm::inverse(q) * v;
  154. }
  155. template<typename T, qualifier Q>
  156. GLM_FUNC_QUALIFIER tdualquat<T, Q> operator*(tdualquat<T, Q> const& q, T const& s)
  157. {
  158. return tdualquat<T, Q>(q.real * s, q.dual * s);
  159. }
  160. template<typename T, qualifier Q>
  161. GLM_FUNC_QUALIFIER tdualquat<T, Q> operator*(T const& s, tdualquat<T, Q> const& q)
  162. {
  163. return q * s;
  164. }
  165. template<typename T, qualifier Q>
  166. GLM_FUNC_QUALIFIER tdualquat<T, Q> operator/(tdualquat<T, Q> const& q, T const& s)
  167. {
  168. return tdualquat<T, Q>(q.real / s, q.dual / s);
  169. }
  170. // -- Boolean operators --
  171. template<typename T, qualifier Q>
  172. GLM_FUNC_QUALIFIER bool operator==(tdualquat<T, Q> const& q1, tdualquat<T, Q> const& q2)
  173. {
  174. return (q1.real == q2.real) && (q1.dual == q2.dual);
  175. }
  176. template<typename T, qualifier Q>
  177. GLM_FUNC_QUALIFIER bool operator!=(tdualquat<T, Q> const& q1, tdualquat<T, Q> const& q2)
  178. {
  179. return (q1.real != q2.real) || (q1.dual != q2.dual);
  180. }
  181. // -- Operations --
  182. template<typename T, qualifier Q>
  183. GLM_FUNC_QUALIFIER tdualquat<T, Q> dual_quat_identity()
  184. {
  185. return tdualquat<T, Q>(
  186. tquat<T, Q>(static_cast<T>(1), static_cast<T>(0), static_cast<T>(0), static_cast<T>(0)),
  187. tquat<T, Q>(static_cast<T>(0), static_cast<T>(0), static_cast<T>(0), static_cast<T>(0)));
  188. }
  189. template<typename T, qualifier Q>
  190. GLM_FUNC_QUALIFIER tdualquat<T, Q> normalize(tdualquat<T, Q> const& q)
  191. {
  192. return q / length(q.real);
  193. }
  194. template<typename T, qualifier Q>
  195. GLM_FUNC_QUALIFIER tdualquat<T, Q> lerp(tdualquat<T, Q> const& x, tdualquat<T, Q> const& y, T const& a)
  196. {
  197. // Dual Quaternion Linear blend aka DLB:
  198. // Lerp is only defined in [0, 1]
  199. assert(a >= static_cast<T>(0));
  200. assert(a <= static_cast<T>(1));
  201. T const k = dot(x.real,y.real) < static_cast<T>(0) ? -a : a;
  202. T const one(1);
  203. return tdualquat<T, Q>(x * (one - a) + y * k);
  204. }
  205. template<typename T, qualifier Q>
  206. GLM_FUNC_QUALIFIER tdualquat<T, Q> inverse(tdualquat<T, Q> const& q)
  207. {
  208. const glm::tquat<T, Q> real = conjugate(q.real);
  209. const glm::tquat<T, Q> dual = conjugate(q.dual);
  210. return tdualquat<T, Q>(real, dual + (real * (-2.0f * dot(real,dual))));
  211. }
  212. template<typename T, qualifier Q>
  213. GLM_FUNC_QUALIFIER mat<2, 4, T, Q> mat2x4_cast(tdualquat<T, Q> const& x)
  214. {
  215. return mat<2, 4, T, Q>( x[0].x, x[0].y, x[0].z, x[0].w, x[1].x, x[1].y, x[1].z, x[1].w );
  216. }
  217. template<typename T, qualifier Q>
  218. GLM_FUNC_QUALIFIER mat<3, 4, T, Q> mat3x4_cast(tdualquat<T, Q> const& x)
  219. {
  220. tquat<T, Q> r = x.real / length2(x.real);
  221. tquat<T, Q> const rr(r.w * x.real.w, r.x * x.real.x, r.y * x.real.y, r.z * x.real.z);
  222. r *= static_cast<T>(2);
  223. T const xy = r.x * x.real.y;
  224. T const xz = r.x * x.real.z;
  225. T const yz = r.y * x.real.z;
  226. T const wx = r.w * x.real.x;
  227. T const wy = r.w * x.real.y;
  228. T const wz = r.w * x.real.z;
  229. vec<4, T, Q> const a(
  230. rr.w + rr.x - rr.y - rr.z,
  231. xy - wz,
  232. xz + wy,
  233. -(x.dual.w * r.x - x.dual.x * r.w + x.dual.y * r.z - x.dual.z * r.y));
  234. vec<4, T, Q> const b(
  235. xy + wz,
  236. rr.w + rr.y - rr.x - rr.z,
  237. yz - wx,
  238. -(x.dual.w * r.y - x.dual.x * r.z - x.dual.y * r.w + x.dual.z * r.x));
  239. vec<4, T, Q> const c(
  240. xz - wy,
  241. yz + wx,
  242. rr.w + rr.z - rr.x - rr.y,
  243. -(x.dual.w * r.z + x.dual.x * r.y - x.dual.y * r.x - x.dual.z * r.w));
  244. return mat<3, 4, T, Q>(a, b, c);
  245. }
  246. template<typename T, qualifier Q>
  247. GLM_FUNC_QUALIFIER tdualquat<T, Q> dualquat_cast(mat<2, 4, T, Q> const& x)
  248. {
  249. return tdualquat<T, Q>(
  250. tquat<T, Q>( x[0].w, x[0].x, x[0].y, x[0].z ),
  251. tquat<T, Q>( x[1].w, x[1].x, x[1].y, x[1].z ));
  252. }
  253. template<typename T, qualifier Q>
  254. GLM_FUNC_QUALIFIER tdualquat<T, Q> dualquat_cast(mat<3, 4, T, Q> const& x)
  255. {
  256. tquat<T, Q> real;
  257. T const trace = x[0].x + x[1].y + x[2].z;
  258. if(trace > static_cast<T>(0))
  259. {
  260. T const r = sqrt(T(1) + trace);
  261. T const invr = static_cast<T>(0.5) / r;
  262. real.w = static_cast<T>(0.5) * r;
  263. real.x = (x[2].y - x[1].z) * invr;
  264. real.y = (x[0].z - x[2].x) * invr;
  265. real.z = (x[1].x - x[0].y) * invr;
  266. }
  267. else if(x[0].x > x[1].y && x[0].x > x[2].z)
  268. {
  269. T const r = sqrt(T(1) + x[0].x - x[1].y - x[2].z);
  270. T const invr = static_cast<T>(0.5) / r;
  271. real.x = static_cast<T>(0.5)*r;
  272. real.y = (x[1].x + x[0].y) * invr;
  273. real.z = (x[0].z + x[2].x) * invr;
  274. real.w = (x[2].y - x[1].z) * invr;
  275. }
  276. else if(x[1].y > x[2].z)
  277. {
  278. T const r = sqrt(T(1) + x[1].y - x[0].x - x[2].z);
  279. T const invr = static_cast<T>(0.5) / r;
  280. real.x = (x[1].x + x[0].y) * invr;
  281. real.y = static_cast<T>(0.5) * r;
  282. real.z = (x[2].y + x[1].z) * invr;
  283. real.w = (x[0].z - x[2].x) * invr;
  284. }
  285. else
  286. {
  287. T const r = sqrt(T(1) + x[2].z - x[0].x - x[1].y);
  288. T const invr = static_cast<T>(0.5) / r;
  289. real.x = (x[0].z + x[2].x) * invr;
  290. real.y = (x[2].y + x[1].z) * invr;
  291. real.z = static_cast<T>(0.5) * r;
  292. real.w = (x[1].x - x[0].y) * invr;
  293. }
  294. tquat<T, Q> dual;
  295. dual.x = static_cast<T>(0.5) * ( x[0].w * real.w + x[1].w * real.z - x[2].w * real.y);
  296. dual.y = static_cast<T>(0.5) * (-x[0].w * real.z + x[1].w * real.w + x[2].w * real.x);
  297. dual.z = static_cast<T>(0.5) * ( x[0].w * real.y - x[1].w * real.x + x[2].w * real.w);
  298. dual.w = -static_cast<T>(0.5) * ( x[0].w * real.x + x[1].w * real.y + x[2].w * real.z);
  299. return tdualquat<T, Q>(real, dual);
  300. }
  301. }//namespace glm