Searched refs:m_v0 (Results 1 - 7 of 7) sorted by relevance
/external/jmonkeyengine/engine/src/tools/jme3tools/converters/model/strip/ |
H A D | FaceInfo.java | 38 int m_v0, m_v1, m_v2;
field in class:FaceInfo 44 m_v0 = v0; m_v1 = v1; m_v2 = v2;
51 m_v0 = o.m_v0;
|
H A D | EdgeInfo.java | 41 int m_v0, m_v1;
field in class:EdgeInfo 45 m_v0 = v0;
|
H A D | Stripifier.java | 74 if (infoIter.m_v0 == v0) {
80 if (infoIter.m_v0 == v1)
111 if ((o.m_v0 == faceInfo.m_v0) && (o.m_v1 == faceInfo.m_v1)
265 if (face.m_v0 == face.m_v1)
267 else if (face.m_v0 == face.m_v2)
298 int fv0 = face.m_v0;
347 if (findOtherFace(edgeInfos, faceInfos.at(i).m_v0,
354 faceInfos.at(i).m_v0, faceInfos.at(i)) == null)
434 int facev0 = faceB.m_v0;
[all...] |
H A D | StripInfo.java | 109 if( (faceVec.at(i).m_v0 == face.m_v0) ||
110 (faceVec.at(i).m_v1 == face.m_v0) ||
111 (faceVec.at(i).m_v2 == face.m_v0) )
117 if( (faceVec.at(i).m_v0 == face.m_v1) ||
125 if( (faceVec.at(i).m_v0 == face.m_v2) ||
158 int v0 = (m_startInfo.m_toV1 ? m_startInfo.m_startEdge.m_v0 : m_startInfo.m_startEdge.m_v1);
159 int v1 = (m_startInfo.m_toV1 ? m_startInfo.m_startEdge.m_v1 : m_startInfo.m_startEdge.m_v0);
325 EdgeInfo currEdge = Stripifier.findEdgeInfo(edgeInfos, faceInfo.m_v0, faceInfo.m_v1);
337 currEdge = Stripifier.findEdgeInfo(edgeInfos, faceInfo.m_v2, faceInfo.m_v0);
[all...] |
H A D | TriStrip.java | 174 primGroupArray[0].indices[indexCtr++] = tempStrips.at(i).m_faces.at(j).m_v0;
186 primGroupArray[0].indices[indexCtr++] = tempFaces.at(i).m_v0;
248 primGroupArray[faceGroupLoc].indices[indexCtr++] = tempFaces.at(i).m_v0;
|
/external/deqp/framework/referencerenderer/ |
H A D | rrRasterizer.hpp | 152 tcu::Vec4 m_v0; member in class:rr::TriangleRasterizer 196 tcu::Vec4 m_v0; member in class:rr::SingleSampleLineRasterizer 277 tcu::Vec4 m_v0; member in class:rr::LineExitDiamondGenerator
|
H A D | rrRasterizer.cpp | 99 const tcu::Vector<deInt64,2> m_v0; member in struct:rr::LineRasterUtil::SubpixelLineSegment 103 : m_v0(v0) 110 return m_v1 - m_v0; 153 const tcu::Vector<deInt64,2> v = ( p - l.m_v0); 162 const tcu::Vector<deInt64,2> v = ( p - l.m_v0); 171 const tcu::Vector<deInt64,2> v = ( p - l.m_v0); 183 const tcu::Vector<deInt64,2> u1 = ( p - l.m_v0); 245 const tcu::Vector<deInt64,2> v = (diamondCenter - line.m_v0); 339 if (p != line.m_v0 && p != line.m_v1) 358 const bool startIsInside = corners[ndx].pointInclusive || p != line.m_v0; [all...] |
Completed in 115 milliseconds