collision_solver_sw.cpp 7.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241
  1. /*************************************************************************/
  2. /* collision_solver_sw.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* http://www.godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
  9. /* */
  10. /* Permission is hereby granted, free of charge, to any person obtaining */
  11. /* a copy of this software and associated documentation files (the */
  12. /* "Software"), to deal in the Software without restriction, including */
  13. /* without limitation the rights to use, copy, modify, merge, publish, */
  14. /* distribute, sublicense, and/or sell copies of the Software, and to */
  15. /* permit persons to whom the Software is furnished to do so, subject to */
  16. /* the following conditions: */
  17. /* */
  18. /* The above copyright notice and this permission notice shall be */
  19. /* included in all copies or substantial portions of the Software. */
  20. /* */
  21. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  22. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  23. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
  24. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  25. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  26. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  27. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  28. /*************************************************************************/
  29. #include "collision_solver_sw.h"
  30. #include "collision_solver_sat.h"
  31. #include "gjk_epa.h"
  32. #include "collision_solver_sat.h"
  33. #define collision_solver sat_calculate_penetration
  34. //#define collision_solver gjk_epa_calculate_penetration
  35. bool CollisionSolverSW::solve_static_plane(const ShapeSW *p_shape_A,const Transform& p_transform_A,const ShapeSW *p_shape_B,const Transform& p_transform_B,CallbackResult p_result_callback,void *p_userdata,bool p_swap_result) {
  36. const PlaneShapeSW *plane = static_cast<const PlaneShapeSW*>(p_shape_A);
  37. if (p_shape_B->get_type()==PhysicsServer::SHAPE_PLANE)
  38. return false;
  39. Plane p = p_transform_A.xform(plane->get_plane());
  40. static const int max_supports = 16;
  41. Vector3 supports[max_supports];
  42. int support_count;
  43. p_shape_B->get_supports(p_transform_B.basis.xform_inv(-p.normal).normalized(),max_supports,supports,support_count);
  44. bool found=false;
  45. for(int i=0;i<support_count;i++) {
  46. supports[i] = p_transform_B.xform( supports[i] );
  47. if (p.distance_to(supports[i])>=0)
  48. continue;
  49. found=true;
  50. Vector3 support_A = p.project(supports[i]);
  51. if (p_result_callback) {
  52. if (p_swap_result)
  53. p_result_callback(supports[i],support_A,p_userdata);
  54. else
  55. p_result_callback(support_A,supports[i],p_userdata);
  56. }
  57. }
  58. return found;
  59. }
  60. bool CollisionSolverSW::solve_ray(const ShapeSW *p_shape_A,const Transform& p_transform_A,const ShapeSW *p_shape_B,const Transform& p_transform_B,CallbackResult p_result_callback,void *p_userdata,bool p_swap_result) {
  61. const RayShapeSW *ray = static_cast<const RayShapeSW*>(p_shape_A);
  62. Vector3 from = p_transform_A.origin;
  63. Vector3 to = from+p_transform_A.basis.get_axis(2)*ray->get_length();
  64. Vector3 support_A=to;
  65. Transform ai = p_transform_B.affine_inverse();
  66. from = ai.xform(from);
  67. to = ai.xform(to);
  68. Vector3 p,n;
  69. if (!p_shape_B->intersect_segment(from,to,p,n))
  70. return false;
  71. Vector3 support_B=p_transform_B.xform(p);
  72. if (p_result_callback) {
  73. if (p_swap_result)
  74. p_result_callback(support_B,support_A,p_userdata);
  75. else
  76. p_result_callback(support_A,support_B,p_userdata);
  77. }
  78. return true;
  79. }
  80. struct _ConcaveCollisionInfo {
  81. const Transform *transform_A;
  82. const ShapeSW *shape_A;
  83. const Transform *transform_B;
  84. CollisionSolverSW::CallbackResult result_callback;
  85. void *userdata;
  86. bool swap_result;
  87. bool collided;
  88. int aabb_tests;
  89. int collisions;
  90. };
  91. void CollisionSolverSW::concave_callback(void *p_userdata, ShapeSW *p_convex) {
  92. _ConcaveCollisionInfo &cinfo = *(_ConcaveCollisionInfo*)(p_userdata);
  93. cinfo.aabb_tests++;
  94. bool collided = collision_solver(cinfo.shape_A, *cinfo.transform_A, p_convex,*cinfo.transform_B, cinfo.result_callback, cinfo.userdata, cinfo.swap_result );
  95. if (!collided)
  96. return;
  97. cinfo.collided=true;
  98. cinfo.collisions++;
  99. }
  100. bool CollisionSolverSW::solve_concave(const ShapeSW *p_shape_A,const Transform& p_transform_A,const ShapeSW *p_shape_B,const Transform& p_transform_B,CallbackResult p_result_callback,void *p_userdata,bool p_swap_result) {
  101. const ConcaveShapeSW *concave_B=static_cast<const ConcaveShapeSW*>(p_shape_B);
  102. _ConcaveCollisionInfo cinfo;
  103. cinfo.transform_A=&p_transform_A;
  104. cinfo.shape_A=p_shape_A;
  105. cinfo.transform_B=&p_transform_B;
  106. cinfo.result_callback=p_result_callback;
  107. cinfo.userdata=p_userdata;
  108. cinfo.swap_result=p_swap_result;
  109. cinfo.collided=false;
  110. cinfo.collisions=0;
  111. cinfo.aabb_tests=0;
  112. Transform rel_transform = p_transform_A;
  113. rel_transform.origin-=p_transform_B.origin;
  114. //quickly compute a local AABB
  115. AABB local_aabb;
  116. for(int i=0;i<3;i++) {
  117. Vector3 axis( p_transform_B.basis.get_axis(i) );
  118. float axis_scale = 1.0/axis.length();
  119. axis*=axis_scale;
  120. float smin,smax;
  121. p_shape_A->project_range(axis,rel_transform,smin,smax);
  122. smin*=axis_scale;
  123. smax*=axis_scale;
  124. local_aabb.pos[i]=smin;
  125. local_aabb.size[i]=smax-smin;
  126. }
  127. concave_B->cull(local_aabb,concave_callback,&cinfo);
  128. return cinfo.collided;
  129. }
  130. bool CollisionSolverSW::solve_static(const ShapeSW *p_shape_A,const Transform& p_transform_A,const ShapeSW *p_shape_B,const Transform& p_transform_B,CallbackResult p_result_callback,void *p_userdata,Vector3 *r_sep_axis) {
  131. PhysicsServer::ShapeType type_A=p_shape_A->get_type();
  132. PhysicsServer::ShapeType type_B=p_shape_B->get_type();
  133. bool concave_A=p_shape_A->is_concave();
  134. bool concave_B=p_shape_B->is_concave();
  135. bool swap = false;
  136. if (type_A>type_B) {
  137. SWAP(type_A,type_B);
  138. SWAP(concave_A,concave_B);
  139. swap=true;
  140. }
  141. if (type_A==PhysicsServer::SHAPE_PLANE) {
  142. if (type_B==PhysicsServer::SHAPE_PLANE)
  143. return false;
  144. if (type_B==PhysicsServer::SHAPE_RAY) {
  145. return false;
  146. }
  147. if (swap) {
  148. return solve_static_plane(p_shape_B,p_transform_B,p_shape_A,p_transform_A,p_result_callback,p_userdata,true);
  149. } else {
  150. return solve_static_plane(p_shape_A,p_transform_A,p_shape_B,p_transform_B,p_result_callback,p_userdata,false);
  151. }
  152. } else if (type_A==PhysicsServer::SHAPE_RAY) {
  153. if (type_B==PhysicsServer::SHAPE_RAY)
  154. return false;
  155. if (swap) {
  156. return solve_ray(p_shape_B,p_transform_B,p_shape_A,p_transform_A,p_result_callback,p_userdata,true);
  157. } else {
  158. return solve_ray(p_shape_A,p_transform_A,p_shape_B,p_transform_B,p_result_callback,p_userdata,false);
  159. }
  160. } else if (concave_B) {
  161. if (concave_A)
  162. return false;
  163. if (!swap)
  164. return solve_concave(p_shape_A,p_transform_A,p_shape_B,p_transform_B,p_result_callback,p_userdata,false);
  165. else
  166. return solve_concave(p_shape_B,p_transform_B,p_shape_A,p_transform_A,p_result_callback,p_userdata,true);
  167. } else {
  168. return collision_solver(p_shape_A, p_transform_A, p_shape_B, p_transform_B, p_result_callback,p_userdata,false,r_sep_axis);
  169. }
  170. return false;
  171. }