Searched refs:edge1 (Results 1 - 25 of 28) sorted by relevance

12

/external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/
H A Db2CollidePolygon.cpp65 const b2PolygonShape* poly1, const b2Transform& xf1, int32 edge1,
74 b2Assert(0 <= edge1 && edge1 < poly1->m_count);
77 b2Vec2 normal1 = b2MulT(xf2.q, b2Mul(xf1.q, normals1[edge1]));
97 c[0].id.cf.indexA = (uint8)edge1;
103 c[1].id.cf.indexA = (uint8)edge1;
136 int32 edge1; // reference edge local
146 edge1 = edgeB;
156 edge1 = edgeA;
162 b2FindIncidentEdge(incidentEdge, poly1, xf1, edge1, poly
64 b2FindIncidentEdge(b2ClipVertex c[2], const b2PolygonShape* poly1, const b2Transform& xf1, int32 edge1, const b2PolygonShape* poly2, const b2Transform& xf2) argument
[all...]
H A Db2CollideEdge.cpp245 b2Vec2 edge1 = m_v2 - m_v1; local
246 edge1.Normalize();
247 m_normal1.Set(edge1.y, -edge1.x);
258 convex1 = b2Cross(edge0, edge1) >= 0.0f;
268 convex2 = b2Cross(edge1, edge2) > 0.0f;
555 // Clip incident edge against extruded edge1 side edges.
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/
H A DbtBox2dBox2dCollisionAlgorithm.cpp135 static btScalar EdgeSeparation(const btBox2dShape* poly1, const btTransform& xf1, int edge1, argument
144 btAssert(0 <= edge1 && edge1 < poly1->getVertexCount());
147 btVector3 normal1World = b2Mul(xf1.getBasis(), normals1[edge1]);
157 btVector3 v1 = b2Mul(xf1, vertices1[edge1]);
256 const btBox2dShape* poly1, const btTransform& xf1, int edge1,
265 btAssert(0 <= edge1 && edge1 < poly1->getVertexCount());
268 btVector3 normal1 = b2MulT(xf2.getBasis(), b2Mul(xf1.getBasis(), normals1[edge1]));
288 // c[0].id.features.referenceEdge = (unsigned char)edge1;
255 FindIncidentEdge(ClipVertex c[2], const btBox2dShape* poly1, const btTransform& xf1, int edge1, const btBox2dShape* poly2, const btTransform& xf2) argument
323 int edge1; // reference edge local
[all...]
H A DSphereTriangleDetector.cpp179 btVector3 edge1( *p2 - *p1 );
187 btVector3 edge1_normal( edge1.cross(normal));
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/
H A DbtGeometryUtil.cpp99 btVector3 planeEquation,edge0,edge1; local
101 edge1 = N3-N1;
105 planeEquation = normalSign * edge0.cross(edge1);
/external/vulkan-validation-layers/libs/glm/detail/
H A Dintrinsic_common.hpp77 __m128 sse_ssp_ps(__m128 edge0, __m128 edge1, __m128 x);
H A Dfunc_common.hpp297 /// Returns 0.0 if x <= edge0 and 1.0 if x >= edge1 and
299 /// when edge0 < x < edge1. This is useful in cases where
303 /// t = clamp ((x - edge0) / (edge1 - edge0), 0, 1);
305 /// Results are undefined if edge0 >= edge1.
314 genType const & edge1,
320 typename genType::value_type const & edge1,
/external/opencv3/3rdparty/openexr/Imath/
H A DImathLineAlgo.h157 Vec3<T> edge1 = v2 - v1; local
158 Vec3<T> normal = edge1 % edge0;
202 Vec3<T> en = edge1.normalized();
/external/opencv3/modules/imgproc/src/
H A Dsubdivision2d.cpp594 int edge1 = getEdge( edge0, NEXT_AROUND_LEFT ); local
595 int edge2 = getEdge( edge1, NEXT_AROUND_LEFT );
599 edgeOrg(edge1, &org1);
600 edgeDst(edge1, &dst1);
607 quadedge.pt[3] = qedges[edge1 >> 2].pt[3 - (edge1 & 2)] =
614 int edge1 = getEdge( edge0, NEXT_AROUND_RIGHT ); local
615 int edge2 = getEdge( edge1, NEXT_AROUND_RIGHT );
619 edgeOrg(edge1, &org1);
620 edgeDst(edge1,
[all...]
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/
H A DCollision.java483 final Transform xf1, int edge1, final PolygonShape poly2, final Transform xf2) {
491 assert (0 <= edge1 && edge1 < count1);
499 // Vec2 normal1 = MulT(xf2.R, Mul(xf1.R, normals1[edge1]));
501 // Rot.mulToOutUnsafe(xf1.q, normals1[edge1], normal1); // temporary
504 final Vec2 v = normals1[edge1];
533 c0.id.indexA = (byte) edge1;
543 c1.id.indexA = (byte) edge1;
596 int edge1; // reference edge
605 edge1
482 findIncidentEdge(final ClipVertex[] c, final PolygonShape poly1, final Transform xf1, int edge1, final PolygonShape poly2, final Transform xf2) argument
993 private final Vec2 edge1 = new Vec2(); field in class:Collision.EPCollider
[all...]
/external/opencv/cv/src/
H A Dcvsubdivision2d.cpp661 CvSubdiv2DEdge edge0 = (CvSubdiv2DEdge) quadedge, edge1, edge2; local
668 edge1 = cvSubdiv2DGetEdge( edge0, CV_NEXT_AROUND_LEFT );
669 edge2 = cvSubdiv2DGetEdge( edge1, CV_NEXT_AROUND_LEFT );
672 icvCreateCenterNormalLine( edge1, &a1, &b1, &c1 );
681 ((CvQuadEdge2D *) (edge1 & ~3))->pt[3 - (edge1 & 2)] =
688 edge1 = cvSubdiv2DGetEdge( edge0, CV_NEXT_AROUND_RIGHT );
689 edge2 = cvSubdiv2DGetEdge( edge1, CV_NEXT_AROUND_RIGHT );
692 icvCreateCenterNormalLine( edge1, &a1, &b1, &c1 );
702 ((CvQuadEdge2D *) (edge1
[all...]
/external/freetype/src/autofit/
H A Dafcjk.c1817 AF_Edge edge1, edge2; local
1824 edge1 = NULL;
1829 edge1 = edge;
1834 edge1 = edge2;
1838 if ( !edge1 )
1844 edge1 - edges, edge1->fpos, edge1->opos / 64.0,
1845 blue->fit / 64.0, edge1->pos / 64.0 ));
1850 edge1
2047 AF_Edge edge1, edge2, edge3; local
[all...]
H A Daflatin2.c1882 AF_Edge edge1, edge2; local
1889 edge1 = NULL;
1894 edge1 = edge;
1899 edge1 = edge2;
1903 if ( !edge1 )
1908 edge1-edges, edge1->opos / 64.0, blue->fit / 64.0,
1909 edge1->pos / 64.0 ));
1911 edge1->pos = blue->fit;
1912 edge1
[all...]
H A Daflatin.c2863 AF_Edge edge1, edge2; /* these edges form the stem to check */ local
2869 edge1 = NULL;
2901 edge1 = edge;
2907 edge1 = edge2;
2911 if ( !edge1 )
2918 edge1 - edges, edge1->opos / 64.0, blue->fit / 64.0,
2919 edge1->pos / 64.0, edge - edges ));
2923 edge1 - edges, edge1
3194 AF_Edge edge1, edge2, edge3; local
[all...]
H A Dafloader.c304 AF_Edge edge1 = axis->edges; /* leftmost edge */ local
305 AF_Edge edge2 = edge1 +
312 old_lsb = edge1->opos;
313 new_lsb = edge1->pos;
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/autofit/
H A Dafcjk.c1759 AF_Edge edge1, edge2; local
1766 edge1 = NULL;
1771 edge1 = edge;
1776 edge1 = edge2;
1780 if ( !edge1 )
1786 edge1 - edges, edge1->fpos, edge1->opos / 64.0,
1787 blue->fit / 64.0, edge1->pos / 64.0 ));
1792 edge1
1989 AF_Edge edge1, edge2, edge3; local
[all...]
H A Daflatin2.c1877 AF_Edge edge1, edge2; local
1884 edge1 = NULL;
1889 edge1 = edge;
1894 edge1 = edge2;
1898 if ( !edge1 )
1903 edge1-edges, edge1->opos / 64.0, blue->fit / 64.0,
1904 edge1->pos / 64.0 ));
1906 edge1->pos = blue->fit;
1907 edge1
[all...]
H A Daflatin.c2423 AF_Edge edge1, edge2; /* these edges form the stem to check */ local
2429 edge1 = NULL;
2461 edge1 = edge;
2467 edge1 = edge2;
2471 if ( !edge1 )
2478 edge1 - edges, edge1->opos / 64.0, blue->fit / 64.0,
2479 edge1->pos / 64.0, edge - edges ));
2483 edge1 - edges, edge1
2742 AF_Edge edge1, edge2, edge3; local
[all...]
H A Dafloader.c304 AF_Edge edge1 = axis->edges; /* leftmost edge */ local
305 AF_Edge edge2 = edge1 +
312 old_lsb = edge1->opos;
313 new_lsb = edge1->pos;
/external/skia/samplecode/
H A DSamplePatch.cpp137 SkPoint* edge1 = edge0 + nu; local
138 SkPoint* edge2 = edge1 + nv;
143 eval_patch_edge(fPts + 3, edge1, nv);
166 r[nu] = edge1[row];
/external/vulkan-validation-layers/libs/glm/gtx/
H A Dsimd_vec4.hpp332 //! Returns 0.0 if x <= edge0 and 1.0 if x >= edge1 and
334 //! when edge0 < x < edge1. This is useful in cases where
338 //! t = clamp ((x - edge0) / (edge1 - edge0), 0, 1);
340 //! Results are undefined if edge0 >= edge1.
345 detail::fvec4SIMD const & edge1,
350 float const & edge1,
/external/skia/src/core/
H A DSkScan_Antihair.cpp910 static inline void align_thin_stroke(FDot8& edge1, FDot8& edge2) {
911 SkASSERT(edge1 <= edge2);
913 if (FDot8Floor(edge1) == FDot8Floor(edge2)) {
914 edge2 -= (edge1 & 0xFF);
915 edge1 &= ~0xFF;
/external/opencv/cvaux/src/
H A Dcvlee.cpp107 CvVoronoiEdgeInt* edge1; member in struct:CvVoronoiSiteInt
1797 pEdge = pSite->edge1;
1932 // pNewSite->edge[0] = pSite->edge1
2026 (pEdge != pSite->edge1 && CurrSiteSeq->total == 1))
2555 pEdge2->direction = pSite_next->edge1->direction;
2556 pEdge2->twin_edge = pSite_next->edge1;
2557 pSite_next->edge1->twin_edge = pEdge2;
2566 pSite->edge1 = pEdge1;
2587 pEdge_right = pSite_right->edge1->prev_edge;
2590 pSite_right->edge1
[all...]
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/NarrowPhaseCollision/
H A DbtPolyhedralContactClipping.cpp327 const btVector3 edge1 = hullB.m_uniqueEdges[e1];
328 const btVector3 WorldEdge1 = transB.getBasis() * edge1;
/external/deqp/framework/common/
H A DtcuVectorUtil.hpp71 inline float smoothStep (float edge0, float edge1, float x) argument
74 if (x >= edge1) return 1.0f;
75 float t = de::clamp((x - edge0) / (edge1 - edge0), 0.0f, 1.0f);

Completed in 536 milliseconds

12