btSdfCollisionShape.cpp 2.3 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495
  1. #include "btSdfCollisionShape.h"
  2. #include "btMiniSDF.h"
  3. #include "LinearMath/btAabbUtil2.h"
  4. ATTRIBUTE_ALIGNED16(struct)
  5. btSdfCollisionShapeInternalData
  6. {
  7. BT_DECLARE_ALIGNED_ALLOCATOR();
  8. btVector3 m_localScaling;
  9. btScalar m_margin;
  10. btMiniSDF m_sdf;
  11. btSdfCollisionShapeInternalData()
  12. : m_localScaling(1, 1, 1),
  13. m_margin(0)
  14. {
  15. }
  16. };
  17. bool btSdfCollisionShape::initializeSDF(const char* sdfData, int sizeInBytes)
  18. {
  19. bool valid = m_data->m_sdf.load(sdfData, sizeInBytes);
  20. return valid;
  21. }
  22. btSdfCollisionShape::btSdfCollisionShape()
  23. {
  24. m_shapeType = SDF_SHAPE_PROXYTYPE;
  25. m_data = new btSdfCollisionShapeInternalData();
  26. //"E:/develop/bullet3/data/toys/ground_hole64_64_8.cdf");//ground_cube.cdf");
  27. /*unsigned int field_id=0;
  28. Eigen::Vector3d x (1,10,1);
  29. Eigen::Vector3d gradient;
  30. double dist = m_data->m_sdf.interpolate(field_id, x, &gradient);
  31. printf("dist=%g\n", dist);
  32. */
  33. }
  34. btSdfCollisionShape::~btSdfCollisionShape()
  35. {
  36. delete m_data;
  37. }
  38. void btSdfCollisionShape::getAabb(const btTransform& t, btVector3& aabbMin, btVector3& aabbMax) const
  39. {
  40. btAssert(m_data->m_sdf.isValid());
  41. btVector3 localAabbMin = m_data->m_sdf.m_domain.m_min;
  42. btVector3 localAabbMax = m_data->m_sdf.m_domain.m_max;
  43. btScalar margin(0);
  44. btTransformAabb(localAabbMin, localAabbMax, margin, t, aabbMin, aabbMax);
  45. }
  46. void btSdfCollisionShape::setLocalScaling(const btVector3& scaling)
  47. {
  48. m_data->m_localScaling = scaling;
  49. }
  50. const btVector3& btSdfCollisionShape::getLocalScaling() const
  51. {
  52. return m_data->m_localScaling;
  53. }
  54. void btSdfCollisionShape::calculateLocalInertia(btScalar mass, btVector3& inertia) const
  55. {
  56. inertia.setValue(0, 0, 0);
  57. }
  58. const char* btSdfCollisionShape::getName() const
  59. {
  60. return "btSdfCollisionShape";
  61. }
  62. void btSdfCollisionShape::setMargin(btScalar margin)
  63. {
  64. m_data->m_margin = margin;
  65. }
  66. btScalar btSdfCollisionShape::getMargin() const
  67. {
  68. return m_data->m_margin;
  69. }
  70. void btSdfCollisionShape::processAllTriangles(btTriangleCallback* callback, const btVector3& aabbMin, const btVector3& aabbMax) const
  71. {
  72. //not yet
  73. }
  74. bool btSdfCollisionShape::queryPoint(const btVector3& ptInSDF, btScalar& distOut, btVector3& normal)
  75. {
  76. int field = 0;
  77. btVector3 grad;
  78. double dist;
  79. bool hasResult = m_data->m_sdf.interpolate(field, dist, ptInSDF, &grad);
  80. if (hasResult)
  81. {
  82. normal.setValue(grad[0], grad[1], grad[2]);
  83. distOut = dist;
  84. }
  85. return hasResult;
  86. }