boxBoxDistance.cpp 41 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160
  1. /*
  2. Copyright (C) 2006, 2008 Sony Computer Entertainment Inc.
  3. All rights reserved.
  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. //#include "PfxContactBoxBox.h"
  14. #include <math.h>
  15. #include "../PlatformDefinitions.h"
  16. #include "boxBoxDistance.h"
  17. static inline float sqr( float a )
  18. {
  19. return (a * a);
  20. }
  21. enum BoxSepAxisType
  22. {
  23. A_AXIS, B_AXIS, CROSS_AXIS
  24. };
  25. //-------------------------------------------------------------------------------------------------
  26. // voronoiTol: bevels Voronoi planes slightly which helps when features are parallel.
  27. //-------------------------------------------------------------------------------------------------
  28. static const float voronoiTol = -1.0e-5f;
  29. //-------------------------------------------------------------------------------------------------
  30. // separating axis tests: gaps along each axis are computed, and the axis with the maximum
  31. // gap is stored. cross product axes are normalized.
  32. //-------------------------------------------------------------------------------------------------
  33. #define AaxisTest( dim, letter, first ) \
  34. { \
  35. if ( first ) \
  36. { \
  37. maxGap = gap = gapsA.get##letter(); \
  38. if ( gap > distanceThreshold ) return gap; \
  39. axisType = A_AXIS; \
  40. faceDimA = dim; \
  41. axisA = identity.getCol##dim(); \
  42. } \
  43. else \
  44. { \
  45. gap = gapsA.get##letter(); \
  46. if ( gap > distanceThreshold ) return gap; \
  47. else if ( gap > maxGap ) \
  48. { \
  49. maxGap = gap; \
  50. axisType = A_AXIS; \
  51. faceDimA = dim; \
  52. axisA = identity.getCol##dim(); \
  53. } \
  54. } \
  55. }
  56. #define BaxisTest( dim, letter ) \
  57. { \
  58. gap = gapsB.get##letter(); \
  59. if ( gap > distanceThreshold ) return gap; \
  60. else if ( gap > maxGap ) \
  61. { \
  62. maxGap = gap; \
  63. axisType = B_AXIS; \
  64. faceDimB = dim; \
  65. axisB = identity.getCol##dim(); \
  66. } \
  67. }
  68. #define CrossAxisTest( dima, dimb, letterb ) \
  69. { \
  70. const float lsqr_tolerance = 1.0e-30f; \
  71. float lsqr; \
  72. \
  73. lsqr = lsqrs.getCol##dima().get##letterb(); \
  74. \
  75. if ( lsqr > lsqr_tolerance ) \
  76. { \
  77. float l_recip = 1.0f / sqrtf( lsqr ); \
  78. gap = float(gapsAxB.getCol##dima().get##letterb()) * l_recip; \
  79. \
  80. if ( gap > distanceThreshold ) \
  81. { \
  82. return gap; \
  83. } \
  84. \
  85. if ( gap > maxGap ) \
  86. { \
  87. maxGap = gap; \
  88. axisType = CROSS_AXIS; \
  89. edgeDimA = dima; \
  90. edgeDimB = dimb; \
  91. axisA = cross(identity.getCol##dima(),matrixAB.getCol##dimb()) * l_recip; \
  92. } \
  93. } \
  94. }
  95. //-------------------------------------------------------------------------------------------------
  96. // tests whether a vertex of box B and a face of box A are the closest features
  97. //-------------------------------------------------------------------------------------------------
  98. inline
  99. float
  100. VertexBFaceATest(
  101. bool & inVoronoi,
  102. float & t0,
  103. float & t1,
  104. const vmVector3 & hA,
  105. PE_REF(vmVector3) faceOffsetAB,
  106. PE_REF(vmVector3) faceOffsetBA,
  107. const vmMatrix3 & matrixAB,
  108. const vmMatrix3 & matrixBA,
  109. PE_REF(vmVector3) signsB,
  110. PE_REF(vmVector3) scalesB )
  111. {
  112. // compute a corner of box B in A's coordinate system
  113. vmVector3 corner =
  114. vmVector3( faceOffsetAB + matrixAB.getCol0() * scalesB.getX() + matrixAB.getCol1() * scalesB.getY() );
  115. // compute the parameters of the point on A, closest to this corner
  116. t0 = corner[0];
  117. t1 = corner[1];
  118. if ( t0 > hA[0] )
  119. t0 = hA[0];
  120. else if ( t0 < -hA[0] )
  121. t0 = -hA[0];
  122. if ( t1 > hA[1] )
  123. t1 = hA[1];
  124. else if ( t1 < -hA[1] )
  125. t1 = -hA[1];
  126. // do the Voronoi test: already know the point on B is in the Voronoi region of the
  127. // point on A, check the reverse.
  128. vmVector3 facePointB =
  129. vmVector3( mulPerElem( faceOffsetBA + matrixBA.getCol0() * t0 + matrixBA.getCol1() * t1 - scalesB, signsB ) );
  130. inVoronoi = ( ( facePointB[0] >= voronoiTol * facePointB[2] ) &&
  131. ( facePointB[1] >= voronoiTol * facePointB[0] ) &&
  132. ( facePointB[2] >= voronoiTol * facePointB[1] ) );
  133. return (sqr( corner[0] - t0 ) + sqr( corner[1] - t1 ) + sqr( corner[2] ));
  134. }
  135. #define VertexBFaceA_SetNewMin() \
  136. { \
  137. minDistSqr = distSqr; \
  138. localPointA.setX(t0); \
  139. localPointA.setY(t1); \
  140. localPointB.setX( scalesB.getX() ); \
  141. localPointB.setY( scalesB.getY() ); \
  142. featureA = F; \
  143. featureB = V; \
  144. }
  145. void
  146. VertexBFaceATests(
  147. bool & done,
  148. float & minDistSqr,
  149. vmPoint3 & localPointA,
  150. vmPoint3 & localPointB,
  151. FeatureType & featureA,
  152. FeatureType & featureB,
  153. const vmVector3 & hA,
  154. PE_REF(vmVector3) faceOffsetAB,
  155. PE_REF(vmVector3) faceOffsetBA,
  156. const vmMatrix3 & matrixAB,
  157. const vmMatrix3 & matrixBA,
  158. PE_REF(vmVector3) signsB,
  159. PE_REF(vmVector3) scalesB,
  160. bool first )
  161. {
  162. float t0, t1;
  163. float distSqr;
  164. distSqr = VertexBFaceATest( done, t0, t1, hA, faceOffsetAB, faceOffsetBA,
  165. matrixAB, matrixBA, signsB, scalesB );
  166. if ( first ) {
  167. VertexBFaceA_SetNewMin();
  168. } else {
  169. if ( distSqr < minDistSqr ) {
  170. VertexBFaceA_SetNewMin();
  171. }
  172. }
  173. if ( done )
  174. return;
  175. signsB.setX( -signsB.getX() );
  176. scalesB.setX( -scalesB.getX() );
  177. distSqr = VertexBFaceATest( done, t0, t1, hA, faceOffsetAB, faceOffsetBA,
  178. matrixAB, matrixBA, signsB, scalesB );
  179. if ( distSqr < minDistSqr ) {
  180. VertexBFaceA_SetNewMin();
  181. }
  182. if ( done )
  183. return;
  184. signsB.setY( -signsB.getY() );
  185. scalesB.setY( -scalesB.getY() );
  186. distSqr = VertexBFaceATest( done, t0, t1, hA, faceOffsetAB, faceOffsetBA,
  187. matrixAB, matrixBA, signsB, scalesB );
  188. if ( distSqr < minDistSqr ) {
  189. VertexBFaceA_SetNewMin();
  190. }
  191. if ( done )
  192. return;
  193. signsB.setX( -signsB.getX() );
  194. scalesB.setX( -scalesB.getX() );
  195. distSqr = VertexBFaceATest( done, t0, t1, hA, faceOffsetAB, faceOffsetBA,
  196. matrixAB, matrixBA, signsB, scalesB );
  197. if ( distSqr < minDistSqr ) {
  198. VertexBFaceA_SetNewMin();
  199. }
  200. }
  201. //-------------------------------------------------------------------------------------------------
  202. // VertexAFaceBTest: tests whether a vertex of box A and a face of box B are the closest features
  203. //-------------------------------------------------------------------------------------------------
  204. inline
  205. float
  206. VertexAFaceBTest(
  207. bool & inVoronoi,
  208. float & t0,
  209. float & t1,
  210. const vmVector3 & hB,
  211. PE_REF(vmVector3) faceOffsetAB,
  212. PE_REF(vmVector3) faceOffsetBA,
  213. const vmMatrix3 & matrixAB,
  214. const vmMatrix3 & matrixBA,
  215. PE_REF(vmVector3) signsA,
  216. PE_REF(vmVector3) scalesA )
  217. {
  218. vmVector3 corner =
  219. vmVector3( faceOffsetBA + matrixBA.getCol0() * scalesA.getX() + matrixBA.getCol1() * scalesA.getY() );
  220. t0 = corner[0];
  221. t1 = corner[1];
  222. if ( t0 > hB[0] )
  223. t0 = hB[0];
  224. else if ( t0 < -hB[0] )
  225. t0 = -hB[0];
  226. if ( t1 > hB[1] )
  227. t1 = hB[1];
  228. else if ( t1 < -hB[1] )
  229. t1 = -hB[1];
  230. vmVector3 facePointA =
  231. vmVector3( mulPerElem( faceOffsetAB + matrixAB.getCol0() * t0 + matrixAB.getCol1() * t1 - scalesA, signsA ) );
  232. inVoronoi = ( ( facePointA[0] >= voronoiTol * facePointA[2] ) &&
  233. ( facePointA[1] >= voronoiTol * facePointA[0] ) &&
  234. ( facePointA[2] >= voronoiTol * facePointA[1] ) );
  235. return (sqr( corner[0] - t0 ) + sqr( corner[1] - t1 ) + sqr( corner[2] ));
  236. }
  237. #define VertexAFaceB_SetNewMin() \
  238. { \
  239. minDistSqr = distSqr; \
  240. localPointB.setX(t0); \
  241. localPointB.setY(t1); \
  242. localPointA.setX( scalesA.getX() ); \
  243. localPointA.setY( scalesA.getY() ); \
  244. featureA = V; \
  245. featureB = F; \
  246. }
  247. void
  248. VertexAFaceBTests(
  249. bool & done,
  250. float & minDistSqr,
  251. vmPoint3 & localPointA,
  252. vmPoint3 & localPointB,
  253. FeatureType & featureA,
  254. FeatureType & featureB,
  255. const vmVector3 & hB,
  256. PE_REF(vmVector3) faceOffsetAB,
  257. PE_REF(vmVector3) faceOffsetBA,
  258. const vmMatrix3 & matrixAB,
  259. const vmMatrix3 & matrixBA,
  260. PE_REF(vmVector3) signsA,
  261. PE_REF(vmVector3) scalesA,
  262. bool first )
  263. {
  264. float t0, t1;
  265. float distSqr;
  266. distSqr = VertexAFaceBTest( done, t0, t1, hB, faceOffsetAB, faceOffsetBA,
  267. matrixAB, matrixBA, signsA, scalesA );
  268. if ( first ) {
  269. VertexAFaceB_SetNewMin();
  270. } else {
  271. if ( distSqr < minDistSqr ) {
  272. VertexAFaceB_SetNewMin();
  273. }
  274. }
  275. if ( done )
  276. return;
  277. signsA.setX( -signsA.getX() );
  278. scalesA.setX( -scalesA.getX() );
  279. distSqr = VertexAFaceBTest( done, t0, t1, hB, faceOffsetAB, faceOffsetBA,
  280. matrixAB, matrixBA, signsA, scalesA );
  281. if ( distSqr < minDistSqr ) {
  282. VertexAFaceB_SetNewMin();
  283. }
  284. if ( done )
  285. return;
  286. signsA.setY( -signsA.getY() );
  287. scalesA.setY( -scalesA.getY() );
  288. distSqr = VertexAFaceBTest( done, t0, t1, hB, faceOffsetAB, faceOffsetBA,
  289. matrixAB, matrixBA, signsA, scalesA );
  290. if ( distSqr < minDistSqr ) {
  291. VertexAFaceB_SetNewMin();
  292. }
  293. if ( done )
  294. return;
  295. signsA.setX( -signsA.getX() );
  296. scalesA.setX( -scalesA.getX() );
  297. distSqr = VertexAFaceBTest( done, t0, t1, hB, faceOffsetAB, faceOffsetBA,
  298. matrixAB, matrixBA, signsA, scalesA );
  299. if ( distSqr < minDistSqr ) {
  300. VertexAFaceB_SetNewMin();
  301. }
  302. }
  303. //-------------------------------------------------------------------------------------------------
  304. // CustomEdgeEdgeTest:
  305. //
  306. // tests whether a pair of edges are the closest features
  307. //
  308. // note on the shorthand:
  309. // 'a' & 'b' refer to the edges.
  310. // 'c' is the dimension of the axis that points from the face center to the edge Center
  311. // 'd' is the dimension of the edge Direction
  312. // the dimension of the face normal is 2
  313. //-------------------------------------------------------------------------------------------------
  314. #define CustomEdgeEdgeTest( ac, ac_letter, ad, ad_letter, bc, bc_letter, bd, bd_letter ) \
  315. { \
  316. vmVector3 edgeOffsetAB; \
  317. vmVector3 edgeOffsetBA; \
  318. \
  319. edgeOffsetAB = faceOffsetAB + matrixAB.getCol##bc() * scalesB.get##bc_letter(); \
  320. edgeOffsetAB.set##ac_letter( edgeOffsetAB.get##ac_letter() - scalesA.get##ac_letter() ); \
  321. \
  322. edgeOffsetBA = faceOffsetBA + matrixBA.getCol##ac() * scalesA.get##ac_letter(); \
  323. edgeOffsetBA.set##bc_letter( edgeOffsetBA.get##bc_letter() - scalesB.get##bc_letter() ); \
  324. \
  325. float dirDot = matrixAB.getCol##bd().get##ad_letter(); \
  326. float denom = 1.0f - dirDot*dirDot; \
  327. float edgeOffsetAB_ad = edgeOffsetAB.get##ad_letter(); \
  328. float edgeOffsetBA_bd = edgeOffsetBA.get##bd_letter(); \
  329. \
  330. if ( denom == 0.0f ) \
  331. { \
  332. tA = 0.0f; \
  333. } \
  334. else \
  335. { \
  336. tA = ( edgeOffsetAB_ad + edgeOffsetBA_bd * dirDot ) / denom; \
  337. } \
  338. \
  339. if ( tA < -hA[ad] ) tA = -hA[ad]; \
  340. else if ( tA > hA[ad] ) tA = hA[ad]; \
  341. \
  342. tB = tA * dirDot + edgeOffsetBA_bd; \
  343. \
  344. if ( tB < -hB[bd] ) \
  345. { \
  346. tB = -hB[bd]; \
  347. tA = tB * dirDot + edgeOffsetAB_ad; \
  348. \
  349. if ( tA < -hA[ad] ) tA = -hA[ad]; \
  350. else if ( tA > hA[ad] ) tA = hA[ad]; \
  351. } \
  352. else if ( tB > hB[bd] ) \
  353. { \
  354. tB = hB[bd]; \
  355. tA = tB * dirDot + edgeOffsetAB_ad; \
  356. \
  357. if ( tA < -hA[ad] ) tA = -hA[ad]; \
  358. else if ( tA > hA[ad] ) tA = hA[ad]; \
  359. } \
  360. \
  361. vmVector3 edgeOffAB = vmVector3( mulPerElem( edgeOffsetAB + matrixAB.getCol##bd() * tB, signsA ) );\
  362. vmVector3 edgeOffBA = vmVector3( mulPerElem( edgeOffsetBA + matrixBA.getCol##ad() * tA, signsB ) );\
  363. \
  364. inVoronoi = ( edgeOffAB[ac] >= voronoiTol * edgeOffAB[2] ) && \
  365. ( edgeOffAB[2] >= voronoiTol * edgeOffAB[ac] ) && \
  366. ( edgeOffBA[bc] >= voronoiTol * edgeOffBA[2] ) && \
  367. ( edgeOffBA[2] >= voronoiTol * edgeOffBA[bc] ); \
  368. \
  369. edgeOffAB[ad] -= tA; \
  370. edgeOffBA[bd] -= tB; \
  371. \
  372. return dot(edgeOffAB,edgeOffAB); \
  373. }
  374. float
  375. CustomEdgeEdgeTest_0101(
  376. bool & inVoronoi,
  377. float & tA,
  378. float & tB,
  379. const vmVector3 & hA,
  380. const vmVector3 & hB,
  381. PE_REF(vmVector3) faceOffsetAB,
  382. PE_REF(vmVector3) faceOffsetBA,
  383. const vmMatrix3 & matrixAB,
  384. const vmMatrix3 & matrixBA,
  385. PE_REF(vmVector3) signsA,
  386. PE_REF(vmVector3) signsB,
  387. PE_REF(vmVector3) scalesA,
  388. PE_REF(vmVector3) scalesB )
  389. {
  390. CustomEdgeEdgeTest( 0, X, 1, Y, 0, X, 1, Y );
  391. }
  392. float
  393. CustomEdgeEdgeTest_0110(
  394. bool & inVoronoi,
  395. float & tA,
  396. float & tB,
  397. const vmVector3 & hA,
  398. const vmVector3 & hB,
  399. PE_REF(vmVector3) faceOffsetAB,
  400. PE_REF(vmVector3) faceOffsetBA,
  401. const vmMatrix3 & matrixAB,
  402. const vmMatrix3 & matrixBA,
  403. PE_REF(vmVector3) signsA,
  404. PE_REF(vmVector3) signsB,
  405. PE_REF(vmVector3) scalesA,
  406. PE_REF(vmVector3) scalesB )
  407. {
  408. CustomEdgeEdgeTest( 0, X, 1, Y, 1, Y, 0, X );
  409. }
  410. float
  411. CustomEdgeEdgeTest_1001(
  412. bool & inVoronoi,
  413. float & tA,
  414. float & tB,
  415. const vmVector3 & hA,
  416. const vmVector3 & hB,
  417. PE_REF(vmVector3) faceOffsetAB,
  418. PE_REF(vmVector3) faceOffsetBA,
  419. const vmMatrix3 & matrixAB,
  420. const vmMatrix3 & matrixBA,
  421. PE_REF(vmVector3) signsA,
  422. PE_REF(vmVector3) signsB,
  423. PE_REF(vmVector3) scalesA,
  424. PE_REF(vmVector3) scalesB )
  425. {
  426. CustomEdgeEdgeTest( 1, Y, 0, X, 0, X, 1, Y );
  427. }
  428. float
  429. CustomEdgeEdgeTest_1010(
  430. bool & inVoronoi,
  431. float & tA,
  432. float & tB,
  433. const vmVector3 & hA,
  434. const vmVector3 & hB,
  435. PE_REF(vmVector3) faceOffsetAB,
  436. PE_REF(vmVector3) faceOffsetBA,
  437. const vmMatrix3 & matrixAB,
  438. const vmMatrix3 & matrixBA,
  439. PE_REF(vmVector3) signsA,
  440. PE_REF(vmVector3) signsB,
  441. PE_REF(vmVector3) scalesA,
  442. PE_REF(vmVector3) scalesB )
  443. {
  444. CustomEdgeEdgeTest( 1, Y, 0, X, 1, Y, 0, X );
  445. }
  446. #define EdgeEdge_SetNewMin( ac_letter, ad_letter, bc_letter, bd_letter ) \
  447. { \
  448. minDistSqr = distSqr; \
  449. localPointA.set##ac_letter(scalesA.get##ac_letter()); \
  450. localPointA.set##ad_letter(tA); \
  451. localPointB.set##bc_letter(scalesB.get##bc_letter()); \
  452. localPointB.set##bd_letter(tB); \
  453. otherFaceDimA = testOtherFaceDimA; \
  454. otherFaceDimB = testOtherFaceDimB; \
  455. featureA = E; \
  456. featureB = E; \
  457. }
  458. void
  459. EdgeEdgeTests(
  460. bool & done,
  461. float & minDistSqr,
  462. vmPoint3 & localPointA,
  463. vmPoint3 & localPointB,
  464. int & otherFaceDimA,
  465. int & otherFaceDimB,
  466. FeatureType & featureA,
  467. FeatureType & featureB,
  468. const vmVector3 & hA,
  469. const vmVector3 & hB,
  470. PE_REF(vmVector3) faceOffsetAB,
  471. PE_REF(vmVector3) faceOffsetBA,
  472. const vmMatrix3 & matrixAB,
  473. const vmMatrix3 & matrixBA,
  474. PE_REF(vmVector3) signsA,
  475. PE_REF(vmVector3) signsB,
  476. PE_REF(vmVector3) scalesA,
  477. PE_REF(vmVector3) scalesB,
  478. bool first )
  479. {
  480. float distSqr;
  481. float tA, tB;
  482. int testOtherFaceDimA, testOtherFaceDimB;
  483. testOtherFaceDimA = 0;
  484. testOtherFaceDimB = 0;
  485. distSqr = CustomEdgeEdgeTest_0101( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  486. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  487. if ( first ) {
  488. EdgeEdge_SetNewMin( X, Y, X, Y );
  489. } else {
  490. if ( distSqr < minDistSqr ) {
  491. EdgeEdge_SetNewMin( X, Y, X, Y );
  492. }
  493. }
  494. if ( done )
  495. return;
  496. signsA.setX( -signsA.getX() );
  497. scalesA.setX( -scalesA.getX() );
  498. distSqr = CustomEdgeEdgeTest_0101( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  499. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  500. if ( distSqr < minDistSqr ) {
  501. EdgeEdge_SetNewMin( X, Y, X, Y );
  502. }
  503. if ( done )
  504. return;
  505. signsB.setX( -signsB.getX() );
  506. scalesB.setX( -scalesB.getX() );
  507. distSqr = CustomEdgeEdgeTest_0101( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  508. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  509. if ( distSqr < minDistSqr ) {
  510. EdgeEdge_SetNewMin( X, Y, X, Y );
  511. }
  512. if ( done )
  513. return;
  514. signsA.setX( -signsA.getX() );
  515. scalesA.setX( -scalesA.getX() );
  516. distSqr = CustomEdgeEdgeTest_0101( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  517. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  518. if ( distSqr < minDistSqr ) {
  519. EdgeEdge_SetNewMin( X, Y, X, Y );
  520. }
  521. if ( done )
  522. return;
  523. testOtherFaceDimA = 1;
  524. testOtherFaceDimB = 0;
  525. signsB.setX( -signsB.getX() );
  526. scalesB.setX( -scalesB.getX() );
  527. distSqr = CustomEdgeEdgeTest_1001( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  528. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  529. if ( distSqr < minDistSqr ) {
  530. EdgeEdge_SetNewMin( Y, X, X, Y );
  531. }
  532. if ( done )
  533. return;
  534. signsA.setY( -signsA.getY() );
  535. scalesA.setY( -scalesA.getY() );
  536. distSqr = CustomEdgeEdgeTest_1001( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  537. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  538. if ( distSqr < minDistSqr ) {
  539. EdgeEdge_SetNewMin( Y, X, X, Y );
  540. }
  541. if ( done )
  542. return;
  543. signsB.setX( -signsB.getX() );
  544. scalesB.setX( -scalesB.getX() );
  545. distSqr = CustomEdgeEdgeTest_1001( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  546. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  547. if ( distSqr < minDistSqr ) {
  548. EdgeEdge_SetNewMin( Y, X, X, Y );
  549. }
  550. if ( done )
  551. return;
  552. signsA.setY( -signsA.getY() );
  553. scalesA.setY( -scalesA.getY() );
  554. distSqr = CustomEdgeEdgeTest_1001( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  555. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  556. if ( distSqr < minDistSqr ) {
  557. EdgeEdge_SetNewMin( Y, X, X, Y );
  558. }
  559. if ( done )
  560. return;
  561. testOtherFaceDimA = 0;
  562. testOtherFaceDimB = 1;
  563. signsB.setX( -signsB.getX() );
  564. scalesB.setX( -scalesB.getX() );
  565. distSqr = CustomEdgeEdgeTest_0110( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  566. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  567. if ( distSqr < minDistSqr ) {
  568. EdgeEdge_SetNewMin( X, Y, Y, X );
  569. }
  570. if ( done )
  571. return;
  572. signsA.setX( -signsA.getX() );
  573. scalesA.setX( -scalesA.getX() );
  574. distSqr = CustomEdgeEdgeTest_0110( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  575. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  576. if ( distSqr < minDistSqr ) {
  577. EdgeEdge_SetNewMin( X, Y, Y, X );
  578. }
  579. if ( done )
  580. return;
  581. signsB.setY( -signsB.getY() );
  582. scalesB.setY( -scalesB.getY() );
  583. distSqr = CustomEdgeEdgeTest_0110( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  584. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  585. if ( distSqr < minDistSqr ) {
  586. EdgeEdge_SetNewMin( X, Y, Y, X );
  587. }
  588. if ( done )
  589. return;
  590. signsA.setX( -signsA.getX() );
  591. scalesA.setX( -scalesA.getX() );
  592. distSqr = CustomEdgeEdgeTest_0110( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  593. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  594. if ( distSqr < minDistSqr ) {
  595. EdgeEdge_SetNewMin( X, Y, Y, X );
  596. }
  597. if ( done )
  598. return;
  599. testOtherFaceDimA = 1;
  600. testOtherFaceDimB = 1;
  601. signsB.setY( -signsB.getY() );
  602. scalesB.setY( -scalesB.getY() );
  603. distSqr = CustomEdgeEdgeTest_1010( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  604. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  605. if ( distSqr < minDistSqr ) {
  606. EdgeEdge_SetNewMin( Y, X, Y, X );
  607. }
  608. if ( done )
  609. return;
  610. signsA.setY( -signsA.getY() );
  611. scalesA.setY( -scalesA.getY() );
  612. distSqr = CustomEdgeEdgeTest_1010( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  613. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  614. if ( distSqr < minDistSqr ) {
  615. EdgeEdge_SetNewMin( Y, X, Y, X );
  616. }
  617. if ( done )
  618. return;
  619. signsB.setY( -signsB.getY() );
  620. scalesB.setY( -scalesB.getY() );
  621. distSqr = CustomEdgeEdgeTest_1010( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  622. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  623. if ( distSqr < minDistSqr ) {
  624. EdgeEdge_SetNewMin( Y, X, Y, X );
  625. }
  626. if ( done )
  627. return;
  628. signsA.setY( -signsA.getY() );
  629. scalesA.setY( -scalesA.getY() );
  630. distSqr = CustomEdgeEdgeTest_1010( done, tA, tB, hA, hB, faceOffsetAB, faceOffsetBA,
  631. matrixAB, matrixBA, signsA, signsB, scalesA, scalesB );
  632. if ( distSqr < minDistSqr ) {
  633. EdgeEdge_SetNewMin( Y, X, Y, X );
  634. }
  635. }
  636. float
  637. boxBoxDistance(vmVector3& normal, BoxPoint& boxPointA, BoxPoint& boxPointB,
  638. PE_REF(Box) boxA, const vmTransform3 & transformA, PE_REF(Box) boxB,
  639. const vmTransform3 & transformB,
  640. float distanceThreshold)
  641. {
  642. vmMatrix3 identity;
  643. identity = vmMatrix3::identity();
  644. vmVector3 ident[3];
  645. ident[0] = identity.getCol0();
  646. ident[1] = identity.getCol1();
  647. ident[2] = identity.getCol2();
  648. // get relative transformations
  649. vmTransform3 transformAB, transformBA;
  650. vmMatrix3 matrixAB, matrixBA;
  651. vmVector3 offsetAB, offsetBA;
  652. transformAB = orthoInverse(transformA) * transformB;
  653. transformBA = orthoInverse(transformAB);
  654. matrixAB = transformAB.getUpper3x3();
  655. offsetAB = transformAB.getTranslation();
  656. matrixBA = transformBA.getUpper3x3();
  657. offsetBA = transformBA.getTranslation();
  658. vmMatrix3 absMatrixAB = absPerElem(matrixAB);
  659. vmMatrix3 absMatrixBA = absPerElem(matrixBA);
  660. // find separating axis with largest gap between projections
  661. BoxSepAxisType axisType;
  662. vmVector3 axisA(0.0f), axisB(0.0f);
  663. float gap, maxGap;
  664. int faceDimA = 0, faceDimB = 0, edgeDimA = 0, edgeDimB = 0;
  665. // face axes
  666. vmVector3 gapsA = absPerElem(offsetAB) - boxA.mHalf - absMatrixAB * boxB.mHalf;
  667. AaxisTest(0,X,true);
  668. AaxisTest(1,Y,false);
  669. AaxisTest(2,Z,false);
  670. vmVector3 gapsB = absPerElem(offsetBA) - boxB.mHalf - absMatrixBA * boxA.mHalf;
  671. BaxisTest(0,X);
  672. BaxisTest(1,Y);
  673. BaxisTest(2,Z);
  674. // cross product axes
  675. // ŠO�Ï‚ª‚O‚̂Ƃ«‚Ì‘Î�ô
  676. absMatrixAB += vmMatrix3(1.0e-5f);
  677. absMatrixBA += vmMatrix3(1.0e-5f);
  678. vmMatrix3 lsqrs, projOffset, projAhalf, projBhalf;
  679. lsqrs.setCol0( mulPerElem( matrixBA.getCol2(), matrixBA.getCol2() ) +
  680. mulPerElem( matrixBA.getCol1(), matrixBA.getCol1() ) );
  681. lsqrs.setCol1( mulPerElem( matrixBA.getCol2(), matrixBA.getCol2() ) +
  682. mulPerElem( matrixBA.getCol0(), matrixBA.getCol0() ) );
  683. lsqrs.setCol2( mulPerElem( matrixBA.getCol1(), matrixBA.getCol1() ) +
  684. mulPerElem( matrixBA.getCol0(), matrixBA.getCol0() ) );
  685. projOffset.setCol0(matrixBA.getCol1() * offsetAB.getZ() - matrixBA.getCol2() * offsetAB.getY());
  686. projOffset.setCol1(matrixBA.getCol2() * offsetAB.getX() - matrixBA.getCol0() * offsetAB.getZ());
  687. projOffset.setCol2(matrixBA.getCol0() * offsetAB.getY() - matrixBA.getCol1() * offsetAB.getX());
  688. projAhalf.setCol0(absMatrixBA.getCol1() * boxA.mHalf.getZ() + absMatrixBA.getCol2() * boxA.mHalf.getY());
  689. projAhalf.setCol1(absMatrixBA.getCol2() * boxA.mHalf.getX() + absMatrixBA.getCol0() * boxA.mHalf.getZ());
  690. projAhalf.setCol2(absMatrixBA.getCol0() * boxA.mHalf.getY() + absMatrixBA.getCol1() * boxA.mHalf.getX());
  691. projBhalf.setCol0(absMatrixAB.getCol1() * boxB.mHalf.getZ() + absMatrixAB.getCol2() * boxB.mHalf.getY());
  692. projBhalf.setCol1(absMatrixAB.getCol2() * boxB.mHalf.getX() + absMatrixAB.getCol0() * boxB.mHalf.getZ());
  693. projBhalf.setCol2(absMatrixAB.getCol0() * boxB.mHalf.getY() + absMatrixAB.getCol1() * boxB.mHalf.getX());
  694. vmMatrix3 gapsAxB = absPerElem(projOffset) - projAhalf - transpose(projBhalf);
  695. CrossAxisTest(0,0,X);
  696. CrossAxisTest(0,1,Y);
  697. CrossAxisTest(0,2,Z);
  698. CrossAxisTest(1,0,X);
  699. CrossAxisTest(1,1,Y);
  700. CrossAxisTest(1,2,Z);
  701. CrossAxisTest(2,0,X);
  702. CrossAxisTest(2,1,Y);
  703. CrossAxisTest(2,2,Z);
  704. // need to pick the face on each box whose normal best matches the separating axis.
  705. // will transform vectors to be in the coordinate system of this face to simplify things later.
  706. // for this, a permutation matrix can be used, which the next section computes.
  707. int dimA[3], dimB[3];
  708. if ( axisType == A_AXIS ) {
  709. if ( dot(axisA,offsetAB) < 0.0f )
  710. axisA = -axisA;
  711. axisB = matrixBA * -axisA;
  712. vmVector3 absAxisB = vmVector3(absPerElem(axisB));
  713. if ( ( absAxisB[0] > absAxisB[1] ) && ( absAxisB[0] > absAxisB[2] ) )
  714. faceDimB = 0;
  715. else if ( absAxisB[1] > absAxisB[2] )
  716. faceDimB = 1;
  717. else
  718. faceDimB = 2;
  719. } else if ( axisType == B_AXIS ) {
  720. if ( dot(axisB,offsetBA) < 0.0f )
  721. axisB = -axisB;
  722. axisA = matrixAB * -axisB;
  723. vmVector3 absAxisA = vmVector3(absPerElem(axisA));
  724. if ( ( absAxisA[0] > absAxisA[1] ) && ( absAxisA[0] > absAxisA[2] ) )
  725. faceDimA = 0;
  726. else if ( absAxisA[1] > absAxisA[2] )
  727. faceDimA = 1;
  728. else
  729. faceDimA = 2;
  730. }
  731. if ( axisType == CROSS_AXIS ) {
  732. if ( dot(axisA,offsetAB) < 0.0f )
  733. axisA = -axisA;
  734. axisB = matrixBA * -axisA;
  735. vmVector3 absAxisA = vmVector3(absPerElem(axisA));
  736. vmVector3 absAxisB = vmVector3(absPerElem(axisB));
  737. dimA[1] = edgeDimA;
  738. dimB[1] = edgeDimB;
  739. if ( edgeDimA == 0 ) {
  740. if ( absAxisA[1] > absAxisA[2] ) {
  741. dimA[0] = 2;
  742. dimA[2] = 1;
  743. } else {
  744. dimA[0] = 1;
  745. dimA[2] = 2;
  746. }
  747. } else if ( edgeDimA == 1 ) {
  748. if ( absAxisA[2] > absAxisA[0] ) {
  749. dimA[0] = 0;
  750. dimA[2] = 2;
  751. } else {
  752. dimA[0] = 2;
  753. dimA[2] = 0;
  754. }
  755. } else {
  756. if ( absAxisA[0] > absAxisA[1] ) {
  757. dimA[0] = 1;
  758. dimA[2] = 0;
  759. } else {
  760. dimA[0] = 0;
  761. dimA[2] = 1;
  762. }
  763. }
  764. if ( edgeDimB == 0 ) {
  765. if ( absAxisB[1] > absAxisB[2] ) {
  766. dimB[0] = 2;
  767. dimB[2] = 1;
  768. } else {
  769. dimB[0] = 1;
  770. dimB[2] = 2;
  771. }
  772. } else if ( edgeDimB == 1 ) {
  773. if ( absAxisB[2] > absAxisB[0] ) {
  774. dimB[0] = 0;
  775. dimB[2] = 2;
  776. } else {
  777. dimB[0] = 2;
  778. dimB[2] = 0;
  779. }
  780. } else {
  781. if ( absAxisB[0] > absAxisB[1] ) {
  782. dimB[0] = 1;
  783. dimB[2] = 0;
  784. } else {
  785. dimB[0] = 0;
  786. dimB[2] = 1;
  787. }
  788. }
  789. } else {
  790. dimA[2] = faceDimA;
  791. dimA[0] = (faceDimA+1)%3;
  792. dimA[1] = (faceDimA+2)%3;
  793. dimB[2] = faceDimB;
  794. dimB[0] = (faceDimB+1)%3;
  795. dimB[1] = (faceDimB+2)%3;
  796. }
  797. vmMatrix3 aperm_col, bperm_col;
  798. aperm_col.setCol0(ident[dimA[0]]);
  799. aperm_col.setCol1(ident[dimA[1]]);
  800. aperm_col.setCol2(ident[dimA[2]]);
  801. bperm_col.setCol0(ident[dimB[0]]);
  802. bperm_col.setCol1(ident[dimB[1]]);
  803. bperm_col.setCol2(ident[dimB[2]]);
  804. vmMatrix3 aperm_row, bperm_row;
  805. aperm_row = transpose(aperm_col);
  806. bperm_row = transpose(bperm_col);
  807. // permute all box parameters to be in the face coordinate systems
  808. vmMatrix3 matrixAB_perm = aperm_row * matrixAB * bperm_col;
  809. vmMatrix3 matrixBA_perm = transpose(matrixAB_perm);
  810. vmVector3 offsetAB_perm, offsetBA_perm;
  811. offsetAB_perm = aperm_row * offsetAB;
  812. offsetBA_perm = bperm_row * offsetBA;
  813. vmVector3 halfA_perm, halfB_perm;
  814. halfA_perm = aperm_row * boxA.mHalf;
  815. halfB_perm = bperm_row * boxB.mHalf;
  816. // compute the vector between the centers of each face, in each face's coordinate frame
  817. vmVector3 signsA_perm, signsB_perm, scalesA_perm, scalesB_perm, faceOffsetAB_perm, faceOffsetBA_perm;
  818. signsA_perm = copySignPerElem(vmVector3(1.0f),aperm_row * axisA);
  819. signsB_perm = copySignPerElem(vmVector3(1.0f),bperm_row * axisB);
  820. scalesA_perm = mulPerElem( signsA_perm, halfA_perm );
  821. scalesB_perm = mulPerElem( signsB_perm, halfB_perm );
  822. faceOffsetAB_perm = offsetAB_perm + matrixAB_perm.getCol2() * scalesB_perm.getZ();
  823. faceOffsetAB_perm.setZ( faceOffsetAB_perm.getZ() - scalesA_perm.getZ() );
  824. faceOffsetBA_perm = offsetBA_perm + matrixBA_perm.getCol2() * scalesA_perm.getZ();
  825. faceOffsetBA_perm.setZ( faceOffsetBA_perm.getZ() - scalesB_perm.getZ() );
  826. if ( maxGap < 0.0f ) {
  827. // if boxes overlap, this will separate the faces for finding points of penetration.
  828. faceOffsetAB_perm -= aperm_row * axisA * maxGap * 1.01f;
  829. faceOffsetBA_perm -= bperm_row * axisB * maxGap * 1.01f;
  830. }
  831. // for each vertex/face or edge/edge pair of the two faces, find the closest points.
  832. //
  833. // these points each have an associated box feature (vertex, edge, or face). if each
  834. // point is in the external Voronoi region of the other's feature, they are the
  835. // closest points of the boxes, and the algorithm can exit.
  836. //
  837. // the feature pairs are arranged so that in the general case, the first test will
  838. // succeed. degenerate cases (parallel faces) may require up to all tests in the
  839. // worst case.
  840. //
  841. // if for some reason no case passes the Voronoi test, the features with the minimum
  842. // distance are returned.
  843. vmPoint3 localPointA_perm, localPointB_perm;
  844. float minDistSqr;
  845. bool done;
  846. vmVector3 hA_perm( halfA_perm ), hB_perm( halfB_perm );
  847. localPointA_perm.setZ( scalesA_perm.getZ() );
  848. localPointB_perm.setZ( scalesB_perm.getZ() );
  849. scalesA_perm.setZ(0.0f);
  850. scalesB_perm.setZ(0.0f);
  851. int otherFaceDimA, otherFaceDimB;
  852. FeatureType featureA, featureB;
  853. if ( axisType == CROSS_AXIS ) {
  854. EdgeEdgeTests( done, minDistSqr, localPointA_perm, localPointB_perm,
  855. otherFaceDimA, otherFaceDimB, featureA, featureB,
  856. hA_perm, hB_perm, faceOffsetAB_perm, faceOffsetBA_perm,
  857. matrixAB_perm, matrixBA_perm, signsA_perm, signsB_perm,
  858. scalesA_perm, scalesB_perm, true );
  859. if ( !done ) {
  860. VertexBFaceATests( done, minDistSqr, localPointA_perm, localPointB_perm,
  861. featureA, featureB,
  862. hA_perm, faceOffsetAB_perm, faceOffsetBA_perm,
  863. matrixAB_perm, matrixBA_perm, signsB_perm, scalesB_perm, false );
  864. if ( !done ) {
  865. VertexAFaceBTests( done, minDistSqr, localPointA_perm, localPointB_perm,
  866. featureA, featureB,
  867. hB_perm, faceOffsetAB_perm, faceOffsetBA_perm,
  868. matrixAB_perm, matrixBA_perm, signsA_perm, scalesA_perm, false );
  869. }
  870. }
  871. } else if ( axisType == B_AXIS ) {
  872. VertexAFaceBTests( done, minDistSqr, localPointA_perm, localPointB_perm,
  873. featureA, featureB,
  874. hB_perm, faceOffsetAB_perm, faceOffsetBA_perm,
  875. matrixAB_perm, matrixBA_perm, signsA_perm, scalesA_perm, true );
  876. if ( !done ) {
  877. VertexBFaceATests( done, minDistSqr, localPointA_perm, localPointB_perm,
  878. featureA, featureB,
  879. hA_perm, faceOffsetAB_perm, faceOffsetBA_perm,
  880. matrixAB_perm, matrixBA_perm, signsB_perm, scalesB_perm, false );
  881. if ( !done ) {
  882. EdgeEdgeTests( done, minDistSqr, localPointA_perm, localPointB_perm,
  883. otherFaceDimA, otherFaceDimB, featureA, featureB,
  884. hA_perm, hB_perm, faceOffsetAB_perm, faceOffsetBA_perm,
  885. matrixAB_perm, matrixBA_perm, signsA_perm, signsB_perm,
  886. scalesA_perm, scalesB_perm, false );
  887. }
  888. }
  889. } else {
  890. VertexBFaceATests( done, minDistSqr, localPointA_perm, localPointB_perm,
  891. featureA, featureB,
  892. hA_perm, faceOffsetAB_perm, faceOffsetBA_perm,
  893. matrixAB_perm, matrixBA_perm, signsB_perm, scalesB_perm, true );
  894. if ( !done ) {
  895. VertexAFaceBTests( done, minDistSqr, localPointA_perm, localPointB_perm,
  896. featureA, featureB,
  897. hB_perm, faceOffsetAB_perm, faceOffsetBA_perm,
  898. matrixAB_perm, matrixBA_perm, signsA_perm, scalesA_perm, false );
  899. if ( !done ) {
  900. EdgeEdgeTests( done, minDistSqr, localPointA_perm, localPointB_perm,
  901. otherFaceDimA, otherFaceDimB, featureA, featureB,
  902. hA_perm, hB_perm, faceOffsetAB_perm, faceOffsetBA_perm,
  903. matrixAB_perm, matrixBA_perm, signsA_perm, signsB_perm,
  904. scalesA_perm, scalesB_perm, false );
  905. }
  906. }
  907. }
  908. // convert local points from face-local to box-local coordinate system
  909. boxPointA.localPoint = vmPoint3( aperm_col * vmVector3( localPointA_perm )) ;
  910. boxPointB.localPoint = vmPoint3( bperm_col * vmVector3( localPointB_perm )) ;
  911. #if 0
  912. // find which features of the boxes are involved.
  913. // the only feature pairs which occur in this function are VF, FV, and EE, even though the
  914. // closest points might actually lie on sub-features, as in a VF contact might be used for
  915. // what's actually a VV contact. this means some feature pairs could possibly seem distinct
  916. // from others, although their contact positions are the same. don't know yet whether this
  917. // matters.
  918. int sA[3], sB[3];
  919. sA[0] = boxPointA.localPoint.getX() > 0.0f;
  920. sA[1] = boxPointA.localPoint.getY() > 0.0f;
  921. sA[2] = boxPointA.localPoint.getZ() > 0.0f;
  922. sB[0] = boxPointB.localPoint.getX() > 0.0f;
  923. sB[1] = boxPointB.localPoint.getY() > 0.0f;
  924. sB[2] = boxPointB.localPoint.getZ() > 0.0f;
  925. if ( featureA == F ) {
  926. boxPointA.setFaceFeature( dimA[2], sA[dimA[2]] );
  927. } else if ( featureA == E ) {
  928. boxPointA.setEdgeFeature( dimA[2], sA[dimA[2]], dimA[otherFaceDimA], sA[dimA[otherFaceDimA]] );
  929. } else {
  930. boxPointA.setVertexFeature( sA[0], sA[1], sA[2] );
  931. }
  932. if ( featureB == F ) {
  933. boxPointB.setFaceFeature( dimB[2], sB[dimB[2]] );
  934. } else if ( featureB == E ) {
  935. boxPointB.setEdgeFeature( dimB[2], sB[dimB[2]], dimB[otherFaceDimB], sB[dimB[otherFaceDimB]] );
  936. } else {
  937. boxPointB.setVertexFeature( sB[0], sB[1], sB[2] );
  938. }
  939. #endif
  940. normal = transformA * axisA;
  941. if ( maxGap < 0.0f ) {
  942. return (maxGap);
  943. } else {
  944. return (sqrtf( minDistSqr ));
  945. }
  946. }