btSoftBodyHelpers.cpp 28 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055
  1. /*
  2. Bullet Continuous Collision Detection and Physics Library
  3. Copyright (c) 2003-2006 Erwin Coumans http://continuousphysics.com/Bullet/
  4. This software is provided 'as-is', without any express or implied warranty.
  5. In no event will the authors be held liable for any damages arising from the use of this software.
  6. Permission is granted to anyone to use this software for any purpose,
  7. including commercial applications, and to alter it and redistribute it freely,
  8. subject to the following restrictions:
  9. 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
  10. 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
  11. 3. This notice may not be removed or altered from any source distribution.
  12. */
  13. ///btSoftBodyHelpers.cpp by Nathanael Presson
  14. #include "btSoftBodyInternals.h"
  15. #include <stdio.h>
  16. #include <string.h>
  17. #include "btSoftBodyHelpers.h"
  18. #include "LinearMath/btConvexHull.h"
  19. #include "LinearMath/btConvexHullComputer.h"
  20. //
  21. static void drawVertex( btIDebugDraw* idraw,
  22. const btVector3& x,btScalar s,const btVector3& c)
  23. {
  24. idraw->drawLine(x-btVector3(s,0,0),x+btVector3(s,0,0),c);
  25. idraw->drawLine(x-btVector3(0,s,0),x+btVector3(0,s,0),c);
  26. idraw->drawLine(x-btVector3(0,0,s),x+btVector3(0,0,s),c);
  27. }
  28. //
  29. static void drawBox( btIDebugDraw* idraw,
  30. const btVector3& mins,
  31. const btVector3& maxs,
  32. const btVector3& color)
  33. {
  34. const btVector3 c[]={ btVector3(mins.x(),mins.y(),mins.z()),
  35. btVector3(maxs.x(),mins.y(),mins.z()),
  36. btVector3(maxs.x(),maxs.y(),mins.z()),
  37. btVector3(mins.x(),maxs.y(),mins.z()),
  38. btVector3(mins.x(),mins.y(),maxs.z()),
  39. btVector3(maxs.x(),mins.y(),maxs.z()),
  40. btVector3(maxs.x(),maxs.y(),maxs.z()),
  41. btVector3(mins.x(),maxs.y(),maxs.z())};
  42. idraw->drawLine(c[0],c[1],color);idraw->drawLine(c[1],c[2],color);
  43. idraw->drawLine(c[2],c[3],color);idraw->drawLine(c[3],c[0],color);
  44. idraw->drawLine(c[4],c[5],color);idraw->drawLine(c[5],c[6],color);
  45. idraw->drawLine(c[6],c[7],color);idraw->drawLine(c[7],c[4],color);
  46. idraw->drawLine(c[0],c[4],color);idraw->drawLine(c[1],c[5],color);
  47. idraw->drawLine(c[2],c[6],color);idraw->drawLine(c[3],c[7],color);
  48. }
  49. //
  50. static void drawTree( btIDebugDraw* idraw,
  51. const btDbvtNode* node,
  52. int depth,
  53. const btVector3& ncolor,
  54. const btVector3& lcolor,
  55. int mindepth,
  56. int maxdepth)
  57. {
  58. if(node)
  59. {
  60. if(node->isinternal()&&((depth<maxdepth)||(maxdepth<0)))
  61. {
  62. drawTree(idraw,node->childs[0],depth+1,ncolor,lcolor,mindepth,maxdepth);
  63. drawTree(idraw,node->childs[1],depth+1,ncolor,lcolor,mindepth,maxdepth);
  64. }
  65. if(depth>=mindepth)
  66. {
  67. const btScalar scl=(btScalar)(node->isinternal()?1:1);
  68. const btVector3 mi=node->volume.Center()-node->volume.Extents()*scl;
  69. const btVector3 mx=node->volume.Center()+node->volume.Extents()*scl;
  70. drawBox(idraw,mi,mx,node->isleaf()?lcolor:ncolor);
  71. }
  72. }
  73. }
  74. //
  75. template <typename T>
  76. static inline T sum(const btAlignedObjectArray<T>& items)
  77. {
  78. T v;
  79. if(items.size())
  80. {
  81. v=items[0];
  82. for(int i=1,ni=items.size();i<ni;++i)
  83. {
  84. v+=items[i];
  85. }
  86. }
  87. return(v);
  88. }
  89. //
  90. template <typename T,typename Q>
  91. static inline void add(btAlignedObjectArray<T>& items,const Q& value)
  92. {
  93. for(int i=0,ni=items.size();i<ni;++i)
  94. {
  95. items[i]+=value;
  96. }
  97. }
  98. //
  99. template <typename T,typename Q>
  100. static inline void mul(btAlignedObjectArray<T>& items,const Q& value)
  101. {
  102. for(int i=0,ni=items.size();i<ni;++i)
  103. {
  104. items[i]*=value;
  105. }
  106. }
  107. //
  108. template <typename T>
  109. static inline T average(const btAlignedObjectArray<T>& items)
  110. {
  111. const btScalar n=(btScalar)(items.size()>0?items.size():1);
  112. return(sum(items)/n);
  113. }
  114. //
  115. static inline btScalar tetravolume(const btVector3& x0,
  116. const btVector3& x1,
  117. const btVector3& x2,
  118. const btVector3& x3)
  119. {
  120. const btVector3 a=x1-x0;
  121. const btVector3 b=x2-x0;
  122. const btVector3 c=x3-x0;
  123. return(btDot(a,btCross(b,c)));
  124. }
  125. //
  126. #if 0
  127. static btVector3 stresscolor(btScalar stress)
  128. {
  129. static const btVector3 spectrum[]= { btVector3(1,0,1),
  130. btVector3(0,0,1),
  131. btVector3(0,1,1),
  132. btVector3(0,1,0),
  133. btVector3(1,1,0),
  134. btVector3(1,0,0),
  135. btVector3(1,0,0)};
  136. static const int ncolors=sizeof(spectrum)/sizeof(spectrum[0])-1;
  137. static const btScalar one=1;
  138. stress=btMax<btScalar>(0,btMin<btScalar>(1,stress))*ncolors;
  139. const int sel=(int)stress;
  140. const btScalar frc=stress-sel;
  141. return(spectrum[sel]+(spectrum[sel+1]-spectrum[sel])*frc);
  142. }
  143. #endif
  144. //
  145. void btSoftBodyHelpers::Draw( btSoftBody* psb,
  146. btIDebugDraw* idraw,
  147. int drawflags)
  148. {
  149. const btScalar scl=(btScalar)0.1;
  150. const btScalar nscl=scl*5;
  151. const btVector3 lcolor=btVector3(0,0,0);
  152. const btVector3 ncolor=btVector3(1,1,1);
  153. const btVector3 ccolor=btVector3(1,0,0);
  154. int i,j,nj;
  155. /* Clusters */
  156. if(0!=(drawflags&fDrawFlags::Clusters))
  157. {
  158. srand(1806);
  159. for(i=0;i<psb->m_clusters.size();++i)
  160. {
  161. if(psb->m_clusters[i]->m_collide)
  162. {
  163. btVector3 color( rand()/(btScalar)RAND_MAX,
  164. rand()/(btScalar)RAND_MAX,
  165. rand()/(btScalar)RAND_MAX);
  166. color=color.normalized()*0.75;
  167. btAlignedObjectArray<btVector3> vertices;
  168. vertices.resize(psb->m_clusters[i]->m_nodes.size());
  169. for(j=0,nj=vertices.size();j<nj;++j)
  170. {
  171. vertices[j]=psb->m_clusters[i]->m_nodes[j]->m_x;
  172. }
  173. #define USE_NEW_CONVEX_HULL_COMPUTER
  174. #ifdef USE_NEW_CONVEX_HULL_COMPUTER
  175. btConvexHullComputer computer;
  176. int stride = sizeof(btVector3);
  177. int count = vertices.size();
  178. btScalar shrink=0.f;
  179. btScalar shrinkClamp=0.f;
  180. computer.compute(&vertices[0].getX(),stride,count,shrink,shrinkClamp);
  181. for (int i=0;i<computer.faces.size();i++)
  182. {
  183. int face = computer.faces[i];
  184. //printf("face=%d\n",face);
  185. const btConvexHullComputer::Edge* firstEdge = &computer.edges[face];
  186. const btConvexHullComputer::Edge* edge = firstEdge->getNextEdgeOfFace();
  187. int v0 = firstEdge->getSourceVertex();
  188. int v1 = firstEdge->getTargetVertex();
  189. while (edge!=firstEdge)
  190. {
  191. int v2 = edge->getTargetVertex();
  192. idraw->drawTriangle(computer.vertices[v0],computer.vertices[v1],computer.vertices[v2],color,1);
  193. edge = edge->getNextEdgeOfFace();
  194. v0=v1;
  195. v1=v2;
  196. };
  197. }
  198. #else
  199. HullDesc hdsc(QF_TRIANGLES,vertices.size(),&vertices[0]);
  200. HullResult hres;
  201. HullLibrary hlib;
  202. hdsc.mMaxVertices=vertices.size();
  203. hlib.CreateConvexHull(hdsc,hres);
  204. const btVector3 center=average(hres.m_OutputVertices);
  205. add(hres.m_OutputVertices,-center);
  206. mul(hres.m_OutputVertices,(btScalar)1);
  207. add(hres.m_OutputVertices,center);
  208. for(j=0;j<(int)hres.mNumFaces;++j)
  209. {
  210. const int idx[]={hres.m_Indices[j*3+0],hres.m_Indices[j*3+1],hres.m_Indices[j*3+2]};
  211. idraw->drawTriangle(hres.m_OutputVertices[idx[0]],
  212. hres.m_OutputVertices[idx[1]],
  213. hres.m_OutputVertices[idx[2]],
  214. color,1);
  215. }
  216. hlib.ReleaseResult(hres);
  217. #endif
  218. }
  219. /* Velocities */
  220. #if 0
  221. for(int j=0;j<psb->m_clusters[i].m_nodes.size();++j)
  222. {
  223. const btSoftBody::Cluster& c=psb->m_clusters[i];
  224. const btVector3 r=c.m_nodes[j]->m_x-c.m_com;
  225. const btVector3 v=c.m_lv+btCross(c.m_av,r);
  226. idraw->drawLine(c.m_nodes[j]->m_x,c.m_nodes[j]->m_x+v,btVector3(1,0,0));
  227. }
  228. #endif
  229. /* Frame */
  230. // btSoftBody::Cluster& c=*psb->m_clusters[i];
  231. // idraw->drawLine(c.m_com,c.m_framexform*btVector3(10,0,0),btVector3(1,0,0));
  232. // idraw->drawLine(c.m_com,c.m_framexform*btVector3(0,10,0),btVector3(0,1,0));
  233. // idraw->drawLine(c.m_com,c.m_framexform*btVector3(0,0,10),btVector3(0,0,1));
  234. }
  235. }
  236. else
  237. {
  238. /* Nodes */
  239. if(0!=(drawflags&fDrawFlags::Nodes))
  240. {
  241. for(i=0;i<psb->m_nodes.size();++i)
  242. {
  243. const btSoftBody::Node& n=psb->m_nodes[i];
  244. if(0==(n.m_material->m_flags&btSoftBody::fMaterial::DebugDraw)) continue;
  245. idraw->drawLine(n.m_x-btVector3(scl,0,0),n.m_x+btVector3(scl,0,0),btVector3(1,0,0));
  246. idraw->drawLine(n.m_x-btVector3(0,scl,0),n.m_x+btVector3(0,scl,0),btVector3(0,1,0));
  247. idraw->drawLine(n.m_x-btVector3(0,0,scl),n.m_x+btVector3(0,0,scl),btVector3(0,0,1));
  248. }
  249. }
  250. /* Links */
  251. if(0!=(drawflags&fDrawFlags::Links))
  252. {
  253. for(i=0;i<psb->m_links.size();++i)
  254. {
  255. const btSoftBody::Link& l=psb->m_links[i];
  256. if(0==(l.m_material->m_flags&btSoftBody::fMaterial::DebugDraw)) continue;
  257. idraw->drawLine(l.m_n[0]->m_x,l.m_n[1]->m_x,lcolor);
  258. }
  259. }
  260. /* Normals */
  261. if(0!=(drawflags&fDrawFlags::Normals))
  262. {
  263. for(i=0;i<psb->m_nodes.size();++i)
  264. {
  265. const btSoftBody::Node& n=psb->m_nodes[i];
  266. if(0==(n.m_material->m_flags&btSoftBody::fMaterial::DebugDraw)) continue;
  267. const btVector3 d=n.m_n*nscl;
  268. idraw->drawLine(n.m_x,n.m_x+d,ncolor);
  269. idraw->drawLine(n.m_x,n.m_x-d,ncolor*0.5);
  270. }
  271. }
  272. /* Contacts */
  273. if(0!=(drawflags&fDrawFlags::Contacts))
  274. {
  275. static const btVector3 axis[]={btVector3(1,0,0),
  276. btVector3(0,1,0),
  277. btVector3(0,0,1)};
  278. for(i=0;i<psb->m_rcontacts.size();++i)
  279. {
  280. const btSoftBody::RContact& c=psb->m_rcontacts[i];
  281. const btVector3 o= c.m_node->m_x-c.m_cti.m_normal*
  282. (btDot(c.m_node->m_x,c.m_cti.m_normal)+c.m_cti.m_offset);
  283. const btVector3 x=btCross(c.m_cti.m_normal,axis[c.m_cti.m_normal.minAxis()]).normalized();
  284. const btVector3 y=btCross(x,c.m_cti.m_normal).normalized();
  285. idraw->drawLine(o-x*nscl,o+x*nscl,ccolor);
  286. idraw->drawLine(o-y*nscl,o+y*nscl,ccolor);
  287. idraw->drawLine(o,o+c.m_cti.m_normal*nscl*3,btVector3(1,1,0));
  288. }
  289. }
  290. /* Faces */
  291. if(0!=(drawflags&fDrawFlags::Faces))
  292. {
  293. const btScalar scl=(btScalar)0.8;
  294. const btScalar alp=(btScalar)1;
  295. const btVector3 col(0,(btScalar)0.7,0);
  296. for(i=0;i<psb->m_faces.size();++i)
  297. {
  298. const btSoftBody::Face& f=psb->m_faces[i];
  299. if(0==(f.m_material->m_flags&btSoftBody::fMaterial::DebugDraw)) continue;
  300. const btVector3 x[]={f.m_n[0]->m_x,f.m_n[1]->m_x,f.m_n[2]->m_x};
  301. const btVector3 c=(x[0]+x[1]+x[2])/3;
  302. idraw->drawTriangle((x[0]-c)*scl+c,
  303. (x[1]-c)*scl+c,
  304. (x[2]-c)*scl+c,
  305. col,alp);
  306. }
  307. }
  308. /* Tetras */
  309. if(0!=(drawflags&fDrawFlags::Tetras))
  310. {
  311. const btScalar scl=(btScalar)0.8;
  312. const btScalar alp=(btScalar)1;
  313. const btVector3 col((btScalar)0.3,(btScalar)0.3,(btScalar)0.7);
  314. for(int i=0;i<psb->m_tetras.size();++i)
  315. {
  316. const btSoftBody::Tetra& t=psb->m_tetras[i];
  317. if(0==(t.m_material->m_flags&btSoftBody::fMaterial::DebugDraw)) continue;
  318. const btVector3 x[]={t.m_n[0]->m_x,t.m_n[1]->m_x,t.m_n[2]->m_x,t.m_n[3]->m_x};
  319. const btVector3 c=(x[0]+x[1]+x[2]+x[3])/4;
  320. idraw->drawTriangle((x[0]-c)*scl+c,(x[1]-c)*scl+c,(x[2]-c)*scl+c,col,alp);
  321. idraw->drawTriangle((x[0]-c)*scl+c,(x[1]-c)*scl+c,(x[3]-c)*scl+c,col,alp);
  322. idraw->drawTriangle((x[1]-c)*scl+c,(x[2]-c)*scl+c,(x[3]-c)*scl+c,col,alp);
  323. idraw->drawTriangle((x[2]-c)*scl+c,(x[0]-c)*scl+c,(x[3]-c)*scl+c,col,alp);
  324. }
  325. }
  326. }
  327. /* Anchors */
  328. if(0!=(drawflags&fDrawFlags::Anchors))
  329. {
  330. for(i=0;i<psb->m_anchors.size();++i)
  331. {
  332. const btSoftBody::Anchor& a=psb->m_anchors[i];
  333. const btVector3 q=a.m_body->getWorldTransform()*a.m_local;
  334. drawVertex(idraw,a.m_node->m_x,0.25,btVector3(1,0,0));
  335. drawVertex(idraw,q,0.25,btVector3(0,1,0));
  336. idraw->drawLine(a.m_node->m_x,q,btVector3(1,1,1));
  337. }
  338. for(i=0;i<psb->m_nodes.size();++i)
  339. {
  340. const btSoftBody::Node& n=psb->m_nodes[i];
  341. if(0==(n.m_material->m_flags&btSoftBody::fMaterial::DebugDraw)) continue;
  342. if(n.m_im<=0)
  343. {
  344. drawVertex(idraw,n.m_x,0.25,btVector3(1,0,0));
  345. }
  346. }
  347. }
  348. /* Notes */
  349. if(0!=(drawflags&fDrawFlags::Notes))
  350. {
  351. for(i=0;i<psb->m_notes.size();++i)
  352. {
  353. const btSoftBody::Note& n=psb->m_notes[i];
  354. btVector3 p=n.m_offset;
  355. for(int j=0;j<n.m_rank;++j)
  356. {
  357. p+=n.m_nodes[j]->m_x*n.m_coords[j];
  358. }
  359. idraw->draw3dText(p,n.m_text);
  360. }
  361. }
  362. /* Node tree */
  363. if(0!=(drawflags&fDrawFlags::NodeTree)) DrawNodeTree(psb,idraw);
  364. /* Face tree */
  365. if(0!=(drawflags&fDrawFlags::FaceTree)) DrawFaceTree(psb,idraw);
  366. /* Cluster tree */
  367. if(0!=(drawflags&fDrawFlags::ClusterTree)) DrawClusterTree(psb,idraw);
  368. /* Joints */
  369. if(0!=(drawflags&fDrawFlags::Joints))
  370. {
  371. for(i=0;i<psb->m_joints.size();++i)
  372. {
  373. const btSoftBody::Joint* pj=psb->m_joints[i];
  374. switch(pj->Type())
  375. {
  376. case btSoftBody::Joint::eType::Linear:
  377. {
  378. const btSoftBody::LJoint* pjl=(const btSoftBody::LJoint*)pj;
  379. const btVector3 a0=pj->m_bodies[0].xform()*pjl->m_refs[0];
  380. const btVector3 a1=pj->m_bodies[1].xform()*pjl->m_refs[1];
  381. idraw->drawLine(pj->m_bodies[0].xform().getOrigin(),a0,btVector3(1,1,0));
  382. idraw->drawLine(pj->m_bodies[1].xform().getOrigin(),a1,btVector3(0,1,1));
  383. drawVertex(idraw,a0,0.25,btVector3(1,1,0));
  384. drawVertex(idraw,a1,0.25,btVector3(0,1,1));
  385. }
  386. break;
  387. case btSoftBody::Joint::eType::Angular:
  388. {
  389. //const btSoftBody::AJoint* pja=(const btSoftBody::AJoint*)pj;
  390. const btVector3 o0=pj->m_bodies[0].xform().getOrigin();
  391. const btVector3 o1=pj->m_bodies[1].xform().getOrigin();
  392. const btVector3 a0=pj->m_bodies[0].xform().getBasis()*pj->m_refs[0];
  393. const btVector3 a1=pj->m_bodies[1].xform().getBasis()*pj->m_refs[1];
  394. idraw->drawLine(o0,o0+a0*10,btVector3(1,1,0));
  395. idraw->drawLine(o0,o0+a1*10,btVector3(1,1,0));
  396. idraw->drawLine(o1,o1+a0*10,btVector3(0,1,1));
  397. idraw->drawLine(o1,o1+a1*10,btVector3(0,1,1));
  398. break;
  399. }
  400. default:
  401. {
  402. }
  403. }
  404. }
  405. }
  406. }
  407. //
  408. void btSoftBodyHelpers::DrawInfos( btSoftBody* psb,
  409. btIDebugDraw* idraw,
  410. bool masses,
  411. bool areas,
  412. bool /*stress*/)
  413. {
  414. for(int i=0;i<psb->m_nodes.size();++i)
  415. {
  416. const btSoftBody::Node& n=psb->m_nodes[i];
  417. char text[2048]={0};
  418. char buff[1024];
  419. if(masses)
  420. {
  421. sprintf(buff," M(%.2f)",1/n.m_im);
  422. strcat(text,buff);
  423. }
  424. if(areas)
  425. {
  426. sprintf(buff," A(%.2f)",n.m_area);
  427. strcat(text,buff);
  428. }
  429. if(text[0]) idraw->draw3dText(n.m_x,text);
  430. }
  431. }
  432. //
  433. void btSoftBodyHelpers::DrawNodeTree( btSoftBody* psb,
  434. btIDebugDraw* idraw,
  435. int mindepth,
  436. int maxdepth)
  437. {
  438. drawTree(idraw,psb->m_ndbvt.m_root,0,btVector3(1,0,1),btVector3(1,1,1),mindepth,maxdepth);
  439. }
  440. //
  441. void btSoftBodyHelpers::DrawFaceTree( btSoftBody* psb,
  442. btIDebugDraw* idraw,
  443. int mindepth,
  444. int maxdepth)
  445. {
  446. drawTree(idraw,psb->m_fdbvt.m_root,0,btVector3(0,1,0),btVector3(1,0,0),mindepth,maxdepth);
  447. }
  448. //
  449. void btSoftBodyHelpers::DrawClusterTree( btSoftBody* psb,
  450. btIDebugDraw* idraw,
  451. int mindepth,
  452. int maxdepth)
  453. {
  454. drawTree(idraw,psb->m_cdbvt.m_root,0,btVector3(0,1,1),btVector3(1,0,0),mindepth,maxdepth);
  455. }
  456. //
  457. void btSoftBodyHelpers::DrawFrame( btSoftBody* psb,
  458. btIDebugDraw* idraw)
  459. {
  460. if(psb->m_pose.m_bframe)
  461. {
  462. static const btScalar ascl=10;
  463. static const btScalar nscl=(btScalar)0.1;
  464. const btVector3 com=psb->m_pose.m_com;
  465. const btMatrix3x3 trs=psb->m_pose.m_rot*psb->m_pose.m_scl;
  466. const btVector3 Xaxis=(trs*btVector3(1,0,0)).normalized();
  467. const btVector3 Yaxis=(trs*btVector3(0,1,0)).normalized();
  468. const btVector3 Zaxis=(trs*btVector3(0,0,1)).normalized();
  469. idraw->drawLine(com,com+Xaxis*ascl,btVector3(1,0,0));
  470. idraw->drawLine(com,com+Yaxis*ascl,btVector3(0,1,0));
  471. idraw->drawLine(com,com+Zaxis*ascl,btVector3(0,0,1));
  472. for(int i=0;i<psb->m_pose.m_pos.size();++i)
  473. {
  474. const btVector3 x=com+trs*psb->m_pose.m_pos[i];
  475. drawVertex(idraw,x,nscl,btVector3(1,0,1));
  476. }
  477. }
  478. }
  479. //
  480. btSoftBody* btSoftBodyHelpers::CreateRope( btSoftBodyWorldInfo& worldInfo, const btVector3& from,
  481. const btVector3& to,
  482. int res,
  483. int fixeds)
  484. {
  485. /* Create nodes */
  486. const int r=res+2;
  487. btVector3* x=new btVector3[r];
  488. btScalar* m=new btScalar[r];
  489. int i;
  490. for(i=0;i<r;++i)
  491. {
  492. const btScalar t=i/(btScalar)(r-1);
  493. x[i]=lerp(from,to,t);
  494. m[i]=1;
  495. }
  496. btSoftBody* psb= new btSoftBody(&worldInfo,r,x,m);
  497. if(fixeds&1) psb->setMass(0,0);
  498. if(fixeds&2) psb->setMass(r-1,0);
  499. delete[] x;
  500. delete[] m;
  501. /* Create links */
  502. for(i=1;i<r;++i)
  503. {
  504. psb->appendLink(i-1,i);
  505. }
  506. /* Finished */
  507. return(psb);
  508. }
  509. //
  510. btSoftBody* btSoftBodyHelpers::CreatePatch(btSoftBodyWorldInfo& worldInfo,const btVector3& corner00,
  511. const btVector3& corner10,
  512. const btVector3& corner01,
  513. const btVector3& corner11,
  514. int resx,
  515. int resy,
  516. int fixeds,
  517. bool gendiags)
  518. {
  519. #define IDX(_x_,_y_) ((_y_)*rx+(_x_))
  520. /* Create nodes */
  521. if((resx<2)||(resy<2)) return(0);
  522. const int rx=resx;
  523. const int ry=resy;
  524. const int tot=rx*ry;
  525. btVector3* x=new btVector3[tot];
  526. btScalar* m=new btScalar[tot];
  527. int iy;
  528. for(iy=0;iy<ry;++iy)
  529. {
  530. const btScalar ty=iy/(btScalar)(ry-1);
  531. const btVector3 py0=lerp(corner00,corner01,ty);
  532. const btVector3 py1=lerp(corner10,corner11,ty);
  533. for(int ix=0;ix<rx;++ix)
  534. {
  535. const btScalar tx=ix/(btScalar)(rx-1);
  536. x[IDX(ix,iy)]=lerp(py0,py1,tx);
  537. m[IDX(ix,iy)]=1;
  538. }
  539. }
  540. btSoftBody* psb=new btSoftBody(&worldInfo,tot,x,m);
  541. if(fixeds&1) psb->setMass(IDX(0,0),0);
  542. if(fixeds&2) psb->setMass(IDX(rx-1,0),0);
  543. if(fixeds&4) psb->setMass(IDX(0,ry-1),0);
  544. if(fixeds&8) psb->setMass(IDX(rx-1,ry-1),0);
  545. delete[] x;
  546. delete[] m;
  547. /* Create links and faces */
  548. for(iy=0;iy<ry;++iy)
  549. {
  550. for(int ix=0;ix<rx;++ix)
  551. {
  552. const int idx=IDX(ix,iy);
  553. const bool mdx=(ix+1)<rx;
  554. const bool mdy=(iy+1)<ry;
  555. if(mdx) psb->appendLink(idx,IDX(ix+1,iy));
  556. if(mdy) psb->appendLink(idx,IDX(ix,iy+1));
  557. if(mdx&&mdy)
  558. {
  559. if((ix+iy)&1)
  560. {
  561. psb->appendFace(IDX(ix,iy),IDX(ix+1,iy),IDX(ix+1,iy+1));
  562. psb->appendFace(IDX(ix,iy),IDX(ix+1,iy+1),IDX(ix,iy+1));
  563. if(gendiags)
  564. {
  565. psb->appendLink(IDX(ix,iy),IDX(ix+1,iy+1));
  566. }
  567. }
  568. else
  569. {
  570. psb->appendFace(IDX(ix,iy+1),IDX(ix,iy),IDX(ix+1,iy));
  571. psb->appendFace(IDX(ix,iy+1),IDX(ix+1,iy),IDX(ix+1,iy+1));
  572. if(gendiags)
  573. {
  574. psb->appendLink(IDX(ix+1,iy),IDX(ix,iy+1));
  575. }
  576. }
  577. }
  578. }
  579. }
  580. /* Finished */
  581. #undef IDX
  582. return(psb);
  583. }
  584. //
  585. btSoftBody* btSoftBodyHelpers::CreatePatchUV(btSoftBodyWorldInfo& worldInfo,
  586. const btVector3& corner00,
  587. const btVector3& corner10,
  588. const btVector3& corner01,
  589. const btVector3& corner11,
  590. int resx,
  591. int resy,
  592. int fixeds,
  593. bool gendiags,
  594. float* tex_coords)
  595. {
  596. /*
  597. *
  598. * corners:
  599. *
  600. * [0][0] corner00 ------- corner01 [resx][0]
  601. * | |
  602. * | |
  603. * [0][resy] corner10 -------- corner11 [resx][resy]
  604. *
  605. *
  606. *
  607. *
  608. *
  609. *
  610. * "fixedgs" map:
  611. *
  612. * corner00 --> +1
  613. * corner01 --> +2
  614. * corner10 --> +4
  615. * corner11 --> +8
  616. * upper middle --> +16
  617. * left middle --> +32
  618. * right middle --> +64
  619. * lower middle --> +128
  620. * center --> +256
  621. *
  622. *
  623. * tex_coords size (resx-1)*(resy-1)*12
  624. *
  625. *
  626. *
  627. * SINGLE QUAD INTERNALS
  628. *
  629. * 1) btSoftBody's nodes and links,
  630. * diagonal link is optional ("gendiags")
  631. *
  632. *
  633. * node00 ------ node01
  634. * | .
  635. * | .
  636. * | .
  637. * | .
  638. * | .
  639. * node10 node11
  640. *
  641. *
  642. *
  643. * 2) Faces:
  644. * two triangles,
  645. * UV Coordinates (hier example for single quad)
  646. *
  647. * (0,1) (0,1) (1,1)
  648. * 1 |\ 3 \-----| 2
  649. * | \ \ |
  650. * | \ \ |
  651. * | \ \ |
  652. * | \ \ |
  653. * 2 |-----\ 3 \| 1
  654. * (0,0) (1,0) (1,0)
  655. *
  656. *
  657. *
  658. *
  659. *
  660. *
  661. */
  662. #define IDX(_x_,_y_) ((_y_)*rx+(_x_))
  663. /* Create nodes */
  664. if((resx<2)||(resy<2)) return(0);
  665. const int rx=resx;
  666. const int ry=resy;
  667. const int tot=rx*ry;
  668. btVector3* x=new btVector3[tot];
  669. btScalar* m=new btScalar[tot];
  670. int iy;
  671. for(iy=0;iy<ry;++iy)
  672. {
  673. const btScalar ty=iy/(btScalar)(ry-1);
  674. const btVector3 py0=lerp(corner00,corner01,ty);
  675. const btVector3 py1=lerp(corner10,corner11,ty);
  676. for(int ix=0;ix<rx;++ix)
  677. {
  678. const btScalar tx=ix/(btScalar)(rx-1);
  679. x[IDX(ix,iy)]=lerp(py0,py1,tx);
  680. m[IDX(ix,iy)]=1;
  681. }
  682. }
  683. btSoftBody* psb=new btSoftBody(&worldInfo,tot,x,m);
  684. if(fixeds&1) psb->setMass(IDX(0,0),0);
  685. if(fixeds&2) psb->setMass(IDX(rx-1,0),0);
  686. if(fixeds&4) psb->setMass(IDX(0,ry-1),0);
  687. if(fixeds&8) psb->setMass(IDX(rx-1,ry-1),0);
  688. if(fixeds&16) psb->setMass(IDX((rx-1)/2,0),0);
  689. if(fixeds&32) psb->setMass(IDX(0,(ry-1)/2),0);
  690. if(fixeds&64) psb->setMass(IDX(rx-1,(ry-1)/2),0);
  691. if(fixeds&128) psb->setMass(IDX((rx-1)/2,ry-1),0);
  692. if(fixeds&256) psb->setMass(IDX((rx-1)/2,(ry-1)/2),0);
  693. delete[] x;
  694. delete[] m;
  695. int z = 0;
  696. /* Create links and faces */
  697. for(iy=0;iy<ry;++iy)
  698. {
  699. for(int ix=0;ix<rx;++ix)
  700. {
  701. const bool mdx=(ix+1)<rx;
  702. const bool mdy=(iy+1)<ry;
  703. int node00=IDX(ix,iy);
  704. int node01=IDX(ix+1,iy);
  705. int node10=IDX(ix,iy+1);
  706. int node11=IDX(ix+1,iy+1);
  707. if(mdx) psb->appendLink(node00,node01);
  708. if(mdy) psb->appendLink(node00,node10);
  709. if(mdx&&mdy)
  710. {
  711. psb->appendFace(node00,node10,node11);
  712. if (tex_coords) {
  713. tex_coords[z+0]=CalculateUV(resx,resy,ix,iy,0);
  714. tex_coords[z+1]=CalculateUV(resx,resy,ix,iy,1);
  715. tex_coords[z+2]=CalculateUV(resx,resy,ix,iy,0);
  716. tex_coords[z+3]=CalculateUV(resx,resy,ix,iy,2);
  717. tex_coords[z+4]=CalculateUV(resx,resy,ix,iy,3);
  718. tex_coords[z+5]=CalculateUV(resx,resy,ix,iy,2);
  719. }
  720. psb->appendFace(node11,node01,node00);
  721. if (tex_coords) {
  722. tex_coords[z+6 ]=CalculateUV(resx,resy,ix,iy,3);
  723. tex_coords[z+7 ]=CalculateUV(resx,resy,ix,iy,2);
  724. tex_coords[z+8 ]=CalculateUV(resx,resy,ix,iy,3);
  725. tex_coords[z+9 ]=CalculateUV(resx,resy,ix,iy,1);
  726. tex_coords[z+10]=CalculateUV(resx,resy,ix,iy,0);
  727. tex_coords[z+11]=CalculateUV(resx,resy,ix,iy,1);
  728. }
  729. if (gendiags) psb->appendLink(node00,node11);
  730. z += 12;
  731. }
  732. }
  733. }
  734. /* Finished */
  735. #undef IDX
  736. return(psb);
  737. }
  738. float btSoftBodyHelpers::CalculateUV(int resx,int resy,int ix,int iy,int id)
  739. {
  740. /*
  741. *
  742. *
  743. * node00 --- node01
  744. * | |
  745. * node10 --- node11
  746. *
  747. *
  748. * ID map:
  749. *
  750. * node00 s --> 0
  751. * node00 t --> 1
  752. *
  753. * node01 s --> 3
  754. * node01 t --> 1
  755. *
  756. * node10 s --> 0
  757. * node10 t --> 2
  758. *
  759. * node11 s --> 3
  760. * node11 t --> 2
  761. *
  762. *
  763. */
  764. float tc=0.0f;
  765. if (id == 0) {
  766. tc = (1.0f/((resx-1))*ix);
  767. }
  768. else if (id==1) {
  769. tc = (1.0f/((resy-1))*(resy-1-iy));
  770. }
  771. else if (id==2) {
  772. tc = (1.0f/((resy-1))*(resy-1-iy-1));
  773. }
  774. else if (id==3) {
  775. tc = (1.0f/((resx-1))*(ix+1));
  776. }
  777. return tc;
  778. }
  779. //
  780. btSoftBody* btSoftBodyHelpers::CreateEllipsoid(btSoftBodyWorldInfo& worldInfo,const btVector3& center,
  781. const btVector3& radius,
  782. int res)
  783. {
  784. struct Hammersley
  785. {
  786. static void Generate(btVector3* x,int n)
  787. {
  788. for(int i=0;i<n;i++)
  789. {
  790. btScalar p=0.5,t=0;
  791. for(int j=i;j;p*=0.5,j>>=1) if(j&1) t+=p;
  792. btScalar w=2*t-1;
  793. btScalar a=(SIMD_PI+2*i*SIMD_PI)/n;
  794. btScalar s=btSqrt(1-w*w);
  795. *x++=btVector3(s*btCos(a),s*btSin(a),w);
  796. }
  797. }
  798. };
  799. btAlignedObjectArray<btVector3> vtx;
  800. vtx.resize(3+res);
  801. Hammersley::Generate(&vtx[0],vtx.size());
  802. for(int i=0;i<vtx.size();++i)
  803. {
  804. vtx[i]=vtx[i]*radius+center;
  805. }
  806. return(CreateFromConvexHull(worldInfo,&vtx[0],vtx.size()));
  807. }
  808. //
  809. btSoftBody* btSoftBodyHelpers::CreateFromTriMesh(btSoftBodyWorldInfo& worldInfo,const btScalar* vertices,
  810. const int* triangles,
  811. int ntriangles, bool randomizeConstraints)
  812. {
  813. int maxidx=0;
  814. int i,j,ni;
  815. for(i=0,ni=ntriangles*3;i<ni;++i)
  816. {
  817. maxidx=btMax(triangles[i],maxidx);
  818. }
  819. ++maxidx;
  820. btAlignedObjectArray<bool> chks;
  821. btAlignedObjectArray<btVector3> vtx;
  822. chks.resize(maxidx*maxidx,false);
  823. vtx.resize(maxidx);
  824. for(i=0,j=0,ni=maxidx*3;i<ni;++j,i+=3)
  825. {
  826. vtx[j]=btVector3(vertices[i],vertices[i+1],vertices[i+2]);
  827. }
  828. btSoftBody* psb=new btSoftBody(&worldInfo,vtx.size(),&vtx[0],0);
  829. for( i=0,ni=ntriangles*3;i<ni;i+=3)
  830. {
  831. const int idx[]={triangles[i],triangles[i+1],triangles[i+2]};
  832. #define IDX(_x_,_y_) ((_y_)*maxidx+(_x_))
  833. for(int j=2,k=0;k<3;j=k++)
  834. {
  835. if(!chks[IDX(idx[j],idx[k])])
  836. {
  837. chks[IDX(idx[j],idx[k])]=true;
  838. chks[IDX(idx[k],idx[j])]=true;
  839. psb->appendLink(idx[j],idx[k]);
  840. }
  841. }
  842. #undef IDX
  843. psb->appendFace(idx[0],idx[1],idx[2]);
  844. }
  845. if (randomizeConstraints)
  846. {
  847. psb->randomizeConstraints();
  848. }
  849. return(psb);
  850. }
  851. //
  852. btSoftBody* btSoftBodyHelpers::CreateFromConvexHull(btSoftBodyWorldInfo& worldInfo, const btVector3* vertices,
  853. int nvertices, bool randomizeConstraints)
  854. {
  855. HullDesc hdsc(QF_TRIANGLES,nvertices,vertices);
  856. HullResult hres;
  857. HullLibrary hlib;/*??*/
  858. hdsc.mMaxVertices=nvertices;
  859. hlib.CreateConvexHull(hdsc,hres);
  860. btSoftBody* psb=new btSoftBody(&worldInfo,(int)hres.mNumOutputVertices,
  861. &hres.m_OutputVertices[0],0);
  862. for(int i=0;i<(int)hres.mNumFaces;++i)
  863. {
  864. const int idx[]={ static_cast<int>(hres.m_Indices[i*3+0]),
  865. static_cast<int>(hres.m_Indices[i*3+1]),
  866. static_cast<int>(hres.m_Indices[i*3+2])};
  867. if(idx[0]<idx[1]) psb->appendLink( idx[0],idx[1]);
  868. if(idx[1]<idx[2]) psb->appendLink( idx[1],idx[2]);
  869. if(idx[2]<idx[0]) psb->appendLink( idx[2],idx[0]);
  870. psb->appendFace(idx[0],idx[1],idx[2]);
  871. }
  872. hlib.ReleaseResult(hres);
  873. if (randomizeConstraints)
  874. {
  875. psb->randomizeConstraints();
  876. }
  877. return(psb);
  878. }
  879. static int nextLine(const char* buffer)
  880. {
  881. int numBytesRead=0;
  882. while (*buffer != '\n')
  883. {
  884. buffer++;
  885. numBytesRead++;
  886. }
  887. if (buffer[0]==0x0a)
  888. {
  889. buffer++;
  890. numBytesRead++;
  891. }
  892. return numBytesRead;
  893. }
  894. /* Create from TetGen .ele, .face, .node data */
  895. btSoftBody* btSoftBodyHelpers::CreateFromTetGenData(btSoftBodyWorldInfo& worldInfo,
  896. const char* ele,
  897. const char* face,
  898. const char* node,
  899. bool bfacelinks,
  900. bool btetralinks,
  901. bool bfacesfromtetras)
  902. {
  903. btAlignedObjectArray<btVector3> pos;
  904. int nnode=0;
  905. int ndims=0;
  906. int nattrb=0;
  907. int hasbounds=0;
  908. int result = sscanf(node,"%d %d %d %d",&nnode,&ndims,&nattrb,&hasbounds);
  909. result = sscanf(node,"%d %d %d %d",&nnode,&ndims,&nattrb,&hasbounds);
  910. node += nextLine(node);
  911. pos.resize(nnode);
  912. for(int i=0;i<pos.size();++i)
  913. {
  914. int index=0;
  915. //int bound=0;
  916. float x,y,z;
  917. sscanf(node,"%d %f %f %f",&index,&x,&y,&z);
  918. // sn>>index;
  919. // sn>>x;sn>>y;sn>>z;
  920. node += nextLine(node);
  921. //for(int j=0;j<nattrb;++j)
  922. // sn>>a;
  923. //if(hasbounds)
  924. // sn>>bound;
  925. pos[index].setX(btScalar(x));
  926. pos[index].setY(btScalar(y));
  927. pos[index].setZ(btScalar(z));
  928. }
  929. btSoftBody* psb=new btSoftBody(&worldInfo,nnode,&pos[0],0);
  930. #if 0
  931. if(face&&face[0])
  932. {
  933. int nface=0;
  934. sf>>nface;sf>>hasbounds;
  935. for(int i=0;i<nface;++i)
  936. {
  937. int index=0;
  938. int bound=0;
  939. int ni[3];
  940. sf>>index;
  941. sf>>ni[0];sf>>ni[1];sf>>ni[2];
  942. sf>>bound;
  943. psb->appendFace(ni[0],ni[1],ni[2]);
  944. if(btetralinks)
  945. {
  946. psb->appendLink(ni[0],ni[1],0,true);
  947. psb->appendLink(ni[1],ni[2],0,true);
  948. psb->appendLink(ni[2],ni[0],0,true);
  949. }
  950. }
  951. }
  952. #endif
  953. if(ele&&ele[0])
  954. {
  955. int ntetra=0;
  956. int ncorner=0;
  957. int neattrb=0;
  958. sscanf(ele,"%d %d %d",&ntetra,&ncorner,&neattrb);
  959. ele += nextLine(ele);
  960. //se>>ntetra;se>>ncorner;se>>neattrb;
  961. for(int i=0;i<ntetra;++i)
  962. {
  963. int index=0;
  964. int ni[4];
  965. //se>>index;
  966. //se>>ni[0];se>>ni[1];se>>ni[2];se>>ni[3];
  967. sscanf(ele,"%d %d %d %d %d",&index,&ni[0],&ni[1],&ni[2],&ni[3]);
  968. ele+=nextLine(ele);
  969. //for(int j=0;j<neattrb;++j)
  970. // se>>a;
  971. psb->appendTetra(ni[0],ni[1],ni[2],ni[3]);
  972. if(btetralinks)
  973. {
  974. psb->appendLink(ni[0],ni[1],0,true);
  975. psb->appendLink(ni[1],ni[2],0,true);
  976. psb->appendLink(ni[2],ni[0],0,true);
  977. psb->appendLink(ni[0],ni[3],0,true);
  978. psb->appendLink(ni[1],ni[3],0,true);
  979. psb->appendLink(ni[2],ni[3],0,true);
  980. }
  981. }
  982. }
  983. printf("Nodes: %u\r\n",psb->m_nodes.size());
  984. printf("Links: %u\r\n",psb->m_links.size());
  985. printf("Faces: %u\r\n",psb->m_faces.size());
  986. printf("Tetras: %u\r\n",psb->m_tetras.size());
  987. return(psb);
  988. }