Lines Matching refs:epsilon
305 int above(btVector3* vertices,const int3& t, const btVector3 &p, btScalar epsilon);
306 int above(btVector3* vertices,const int3& t, const btVector3 &p, btScalar epsilon)
309 return (btDot(n,p-vertices[t[0]]) > epsilon); // EPSILON???
465 btHullTriangle* HullLibrary::extrudable(btScalar epsilon)
476 return (t->rise >epsilon)?t:NULL ;
536 btScalar epsilon = (bmax-bmin).length() * btScalar(0.001);
537 btAssert (epsilon != 0.0);
564 while(vlimit >0 && ((te=extrudable(epsilon)) != 0))
576 if(above(verts,t,verts[v],btScalar(0.01)*epsilon))
588 if(above(verts,nt,center,btScalar(0.01)*epsilon) || btCross(verts[nt[1]]-verts[nt[0]],verts[nt[2]]-verts[nt[1]]).length()< epsilon*epsilon*btScalar(0.1) )
868 #define EPSILON btScalar(0.000001) /* close enough to consider two btScalaring point numbers to be 'the same'. */
912 if ( dx < EPSILON || dy < EPSILON || dz < EPSILON || svcount < 3 )
917 if ( dx > EPSILON && dx < len ) len = dx;
918 if ( dy > EPSILON && dy < len ) len = dy;
919 if ( dz > EPSILON && dz < len ) len = dz;
927 if ( dx < EPSILON ) dx = len * btScalar(0.05); // 1/5th the shortest non-zero edge.
928 if ( dy < EPSILON ) dy = len * btScalar(0.05);
929 if ( dz < EPSILON ) dz = len * btScalar(0.05);
1064 if ( dx < EPSILON || dy < EPSILON || dz < EPSILON || vcount < 3)
1072 if ( dx >= EPSILON && dx < len ) len = dx;
1073 if ( dy >= EPSILON && dy < len ) len = dy;
1074 if ( dz >= EPSILON && dz < len ) len = dz;
1082 if ( dx < EPSILON ) dx = len * btScalar(0.05); // 1/5th the shortest non-zero edge.
1083 if ( dy < EPSILON ) dy = len * btScalar(0.05);
1084 if ( dz < EPSILON ) dz = len * btScalar(0.05);
