NL3D::CStripifier Class Reference

#include <stripifier.h>

---

Detailed Description

Wrapper to NVidia(tm) Stripifier

Author:

Lionel Berenguier

Nevrax France

Date:

2001

Definition at line 43 of file stripifier.h.

Public Member Functions
	CStripifier ()
	Constructor.
void	optimizeTriangles (const CPrimitiveBlock &in, CPrimitiveBlock &out, uint cacheSize=10)

---

Constructor & Destructor Documentation

NL3D::CStripifier::CStripifier (   )

Constructor. Definition at line 42 of file stripifier.cpp. { }

---

Member Function Documentation

void NL3D::CStripifier::optimizeTriangles (  const CPrimitiveBlock &  in, CPrimitiveBlock &  out, uint  cacheSize = 10 )

reorganize triangles to get efficiency of GPU vertex-cache. Default vertex cache is 10. out get the same list of triangles, but in different order. any list of lines / quads in out are not modified. NB: &in == &out is possible. Definition at line 196 of file stripifier.cpp. References NL3D::CCornerNode::FaceId, NL3D::CVertexCache::getVertexInCache(), in, NL3D::CCornerNode::Next, NL3D::CPrimitiveBlock::reserveTri(), NL3D::CPrimitiveBlock::setNumTri(), sint, NL3D::CVertexCache::tempTouchVertex(), uint, NL3D::COrderFace::v, v, and NL3D::CCornerNode::VertexId. Referenced by NL3D::CMeshMRMSkinnedGeom::CLod::optimizeTriangleOrder(), NL3D::CMeshMRMGeom::CLod::optimizeTriangleOrder(), and NL3D::CMeshGeom::optimizeTriangleOrder(). { vector<COrderFace> inFaces; sint i; sint numTris= in.getNumTri(); // TestYoyo: All the same tri => perfect vertex caching... /*out.setNumTri(numTris); for(i=0;i< numTris; i++) { uint32 v0= *(in.getTriPointer()+0); uint32 v1= *(in.getTriPointer()+1); uint32 v2= *(in.getTriPointer()+2); out.setTri(i, v0, v1, v2); } return;*/ // prepare inIndices. //-------------------- inFaces.resize(numTris); for(i=0;i< numTris; i++) { inFaces[i].v[0]= in.getTriPointer()[i*3 + 0]; inFaces[i].v[1]= in.getTriPointer()[i*3 + 1]; inFaces[i].v[2]= in.getTriPointer()[i*3 + 2]; inFaces[i].Inserted= false; } // build our cache, and compute max number of vertices. //-------------------- int numVerts=0; for (i = 0; i < numTris; i++) { numVerts= max(numVerts, (int)inFaces[i].v[0]); numVerts= max(numVerts, (int)inFaces[i].v[1]); numVerts= max(numVerts, (int)inFaces[i].v[2]); } numVerts++; CVertexCache vertexCache(cacheSize, numVerts); // Compute vertex connectivity. //-------------------- vector<CCornerNode*> vertexConnectivity; vector<CCornerNode> cornerAllocator; cornerAllocator.resize(numTris * 3); vertexConnectivity.resize(numVerts, NULL); // For all triangles. for (i = 0; i < numTris; i++) { COrderFace *ordFace= &inFaces[i]; // For each corner, allocate and fill for(sint j=0; j<3;j++) { sint vertexId= ordFace->v[j]; // allocate a corner CCornerNode *corner= &cornerAllocator[i*3 + j]; // fill it. corner->FaceId= i; corner->VertexId= vertexId; // Link it to the vertex list of faces. corner->Next= vertexConnectivity[vertexId]; vertexConnectivity[vertexId]= corner; } } // build output optimized triangles //-------------------- out.setNumTri(0); out.reserveTri(numTris); for(i=0; i<numTris; i++) { // force insertion of the ith face. sint nextToInsert= i; bool nextToInsertFound= true; while( nextToInsertFound ) { nextToInsertFound= false; // if the face is not yet inserted. if(!inFaces[nextToInsert].Inserted) { // must insert this face. inFaces[nextToInsert].insertInPB(out, vertexCache); sint minC= 3; // look only for faces which use vertices in VertexCache, to get a face with at least one vertex. for(uint j=0; j<cacheSize; j++) { // get a vertex from the vertex cache. uint vertexId= vertexCache.getVertexInCache(j); // if empty entry if(vertexId==0xFFFFFFFF) continue; // parse list of faces which use this vertex. CCornerNode *corner= vertexConnectivity[vertexId]; while(corner) { uint faceId= corner->FaceId; // if the face is not yet inserted. if(!inFaces[faceId].Inserted) { sint c= inFaces[faceId].countCacheMiss(vertexCache); // insert first any face which don't add any vertex in the cache. if(c==0) { inFaces[faceId].insertInPB(out, vertexCache); } // else the one which add the minimum of vertex possible: nextToInsert else { // Add cost of faces that use vertices pushed out (better results...) uint numVOut= c; uint k; for(k=cacheSize-numVOut; k<cacheSize; k++) { uint vertexOutId= vertexCache.getVertexInCache(k); if(vertexOutId==0xFFFFFFFF) continue; // TempRemove the vertex from the cache vertexCache.tempTouchVertex(vertexOutId, false); } // parse all faces that still use those out vertices. for(k=cacheSize-numVOut; k<cacheSize; k++) { uint vertexOutId= vertexCache.getVertexInCache(k); if(vertexOutId==0xFFFFFFFF) continue; CCornerNode *cornerOut= vertexConnectivity[vertexOutId]; while(cornerOut) { uint faceOutId= cornerOut->FaceId; // if the face is not yet inserted AND not the one treated if(!inFaces[faceOutId].Inserted && faceOutId!=faceId) { // Add cache miss of this face c+= inFaces[faceOutId].countCacheMiss(vertexCache); } // next corner cornerOut= cornerOut->Next; } } // reset touch for(k=cacheSize-numVOut; k<cacheSize; k++) { uint vertexOutId= vertexCache.getVertexInCache(k); if(vertexOutId==0xFFFFFFFF) continue; // restore TempTouch the vertex from the cache vertexCache.tempTouchVertex(vertexOutId, true); } // take the minimum cost if(c<minC) { nextToInsert= faceId; nextToInsertFound= true; minC= c; } } } // next corner corner= corner->Next; } } // if nextToInsertFound, then nextToInsert has the face which add the minimum of vertex possible in the cache } } } }

---

The documentation for this class was generated from the following files:

• stripifier.h
• stripifier.cpp

---