odemath.cpp 7.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247
  1. /*************************************************************************
  2. * *
  3. * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
  4. * All rights reserved. Email: [email protected] Web: www.q12.org *
  5. * *
  6. * This library is free software; you can redistribute it and/or *
  7. * modify it under the terms of EITHER: *
  8. * (1) The GNU Lesser General Public License as published by the Free *
  9. * Software Foundation; either version 2.1 of the License, or (at *
  10. * your option) any later version. The text of the GNU Lesser *
  11. * General Public License is included with this library in the *
  12. * file LICENSE.TXT. *
  13. * (2) The BSD-style license that is included with this library in *
  14. * the file LICENSE-BSD.TXT. *
  15. * *
  16. * This library is distributed in the hope that it will be useful, *
  17. * but WITHOUT ANY WARRANTY; without even the implied warranty of *
  18. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
  19. * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
  20. * *
  21. *************************************************************************/
  22. //234567890123456789012345678901234567890123456789012345678901234567890123456789
  23. // 1 2 3 4 5 6 7
  24. #include <UnitTest++.h>
  25. #include <ode/ode.h>
  26. #include <ode/odemath.h>
  27. TEST(test_dNormalization3)
  28. {
  29. const dVector3 x = {1,0,0,0};
  30. const dVector3 y = {0,1,0,0};
  31. const dVector3 z = {0,0,1,0};
  32. dVector3 v;
  33. // Check when value in first component (i.e. [0])
  34. v[0] = REAL(1.0);
  35. v[1] = REAL(0.0);
  36. v[2] = REAL(0.0);
  37. dSafeNormalize3(v);
  38. CHECK_ARRAY_CLOSE(x, v, 3, 1e-6);
  39. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  40. v[0] = REAL(0.1);
  41. v[1] = REAL(0.0);
  42. v[2] = REAL(0.0);
  43. dSafeNormalize3(v);
  44. CHECK_ARRAY_CLOSE(x, v, 3, 1e-6);
  45. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  46. v[0] = REAL(1e-20);
  47. v[1] = REAL(0.0);
  48. v[2] = REAL(0.0);
  49. dSafeNormalize3(v);
  50. CHECK_ARRAY_CLOSE(x, v, 3, 1e-6);
  51. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  52. // Check when value in first component (i.e. [0])
  53. v[0] = REAL(0.0);
  54. v[1] = REAL(1.0);
  55. v[2] = REAL(0.0);
  56. dSafeNormalize3(v);
  57. CHECK_ARRAY_CLOSE(y, v, 3, 1e-6);
  58. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  59. v[0] = REAL(0.0);
  60. v[1] = REAL(0.1);
  61. v[2] = REAL(0.0);
  62. dSafeNormalize3(v);
  63. CHECK_ARRAY_CLOSE(y, v, 3, 1e-6);
  64. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  65. v[0] = REAL(0.0);
  66. v[1] = REAL(1e-20);
  67. v[2] = REAL(0.0);
  68. dSafeNormalize3(v);
  69. CHECK_ARRAY_CLOSE(y, v, 3, 1e-6);
  70. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  71. // Check when value in first component (i.e. [0])
  72. v[0] = REAL(0.0);
  73. v[1] = REAL(0.0);
  74. v[2] = REAL(1.0);
  75. dSafeNormalize3(v);
  76. CHECK_ARRAY_CLOSE(z, v, 3, 1e-6);
  77. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  78. v[0] = REAL(0.0);
  79. v[1] = REAL(0.0);
  80. v[2] = REAL(0.1);
  81. dSafeNormalize3(v);
  82. CHECK_ARRAY_CLOSE(z, v, 3, 1e-6);
  83. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  84. v[0] = REAL(0.0);
  85. v[1] = REAL(0.0);
  86. v[2] = REAL(1e-20);
  87. dSafeNormalize3(v);
  88. CHECK_ARRAY_CLOSE(z, v, 3, 1e-6);
  89. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  90. // Check negative
  91. // Check when value in first component (i.e. [0])
  92. v[0] = REAL(-1.0);
  93. v[1] = REAL(0.0);
  94. v[2] = REAL(0.0);
  95. dSafeNormalize3(v);
  96. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  97. v[0] = REAL(-0.1);
  98. v[1] = REAL(0.0);
  99. v[2] = REAL(0.0);
  100. dSafeNormalize3(v);
  101. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  102. v[0] = REAL(-1e-20);
  103. v[1] = REAL(0.0);
  104. v[2] = REAL(0.0);
  105. dSafeNormalize3(v);
  106. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  107. // Check when value in first component (i.e. [0])
  108. v[0] = REAL(0.0);
  109. v[1] = REAL(-1.0);
  110. v[2] = REAL(0.0);
  111. dSafeNormalize3(v);
  112. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  113. v[0] = REAL(0.0);
  114. v[1] = REAL(-0.1);
  115. v[2] = REAL(0.0);
  116. dSafeNormalize3(v);
  117. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  118. v[0] = REAL(0.0);
  119. v[1] = REAL(-1e-20);
  120. v[2] = REAL(0.0);
  121. dSafeNormalize3(v);
  122. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  123. // Check when value in first component (i.e. [0])
  124. v[0] = REAL(0.0);
  125. v[1] = REAL(0.0);
  126. v[2] = REAL(-1.0);
  127. dSafeNormalize3(v);
  128. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  129. v[0] = REAL(0.0);
  130. v[1] = REAL(0.0);
  131. v[2] = REAL(-0.1);
  132. dSafeNormalize3(v);
  133. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  134. v[0] = REAL(0.0);
  135. v[1] = REAL(0.0);
  136. v[2] = REAL(-1e-20);
  137. dSafeNormalize3(v);
  138. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  139. v[0] = REAL(9999999999.0);
  140. v[1] = REAL(0.0);
  141. v[2] = REAL(1e-20);
  142. dSafeNormalize3(v);
  143. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  144. v[0] = REAL(9999999999.0);
  145. v[1] = REAL(9999.0);
  146. v[2] = REAL(9.0);
  147. dSafeNormalize3(v);
  148. CHECK_EQUAL(dCalcVectorLength3(v), REAL(1.0));
  149. }
  150. TEST(test_dOrthogonalizeR)
  151. {
  152. {
  153. dMatrix3 r1 = { 1, 0, 0, 0,
  154. 0, 1, 0, 0,
  155. 0, 0, 1, 0
  156. };
  157. dMatrix3 r2;
  158. memcpy(r2, r1, sizeof(dMatrix3));
  159. dOrthogonalizeR(r2);
  160. CHECK_ARRAY_EQUAL(r1, r2, 12);
  161. }
  162. {
  163. dMatrix3 r1 = { 0, 1, 0, 0,
  164. 0, 0, 1, 0,
  165. 1, 0, 0, 0
  166. };
  167. dMatrix3 r2;
  168. memcpy(r2, r1, sizeof(dMatrix3));
  169. dOrthogonalizeR(r2);
  170. CHECK_ARRAY_EQUAL(r1, r2, 12);
  171. }
  172. {
  173. dMatrix3 r1 = { 0, 0, 1, 0,
  174. 1, 0, 0, 0,
  175. 0, 1, 0, 0
  176. };
  177. dMatrix3 r2;
  178. memcpy(r2, r1, sizeof(dMatrix3));
  179. dOrthogonalizeR(r2);
  180. CHECK_ARRAY_EQUAL(r1, r2, 12);
  181. }
  182. {
  183. dMatrix3 r1 = { -1, 0, 0, 0,
  184. 0, 1, 0, 0,
  185. 0, 0, -1, 0
  186. };
  187. dMatrix3 r2;
  188. memcpy(r2, r1, sizeof(dMatrix3));
  189. dOrthogonalizeR(r2);
  190. CHECK_ARRAY_EQUAL(r1, r2, 12);
  191. }
  192. {
  193. dMatrix3 r1 = { 0, -1, 0, 0,
  194. 0, 0, 1, 0,
  195. -1, 0, 0, 0
  196. };
  197. dMatrix3 r2;
  198. memcpy(r2, r1, sizeof(dMatrix3));
  199. dOrthogonalizeR(r2);
  200. CHECK_ARRAY_EQUAL(r1, r2, 12);
  201. }
  202. {
  203. dMatrix3 r1 = { 0, 0, -1, 0,
  204. 0, -1, 0, 0,
  205. -1, 0, 0, 0
  206. };
  207. dMatrix3 r2;
  208. memcpy(r2, r1, sizeof(dMatrix3));
  209. dOrthogonalizeR(r2);
  210. CHECK_ARRAY_EQUAL(r1, r2, 12);
  211. }
  212. }