Searched refs:botV (Results 1 - 5 of 5) sorted by relevance

/xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
H A DmonoPolyPart.cc93 directedLine *tempV, *topV, *botV; local in function:monoPolyPart
94 topV = botV = polygon;
100 if(compV2InY(botV->head(), tempV->head())>0) {
101 botV = tempV;
111 for(tempV=topV->getNext(); tempV != botV; tempV = tempV->getNext())
124 A = botV;
133 for(tempV=topV->getPrev(); tempV != botV; tempV = tempV->getPrev())
145 B = botV;
166 //if both B and D are equal to botV, then this polygon is already
168 if(A == botV
[all...]
H A DsampleMonoPoly.cc102 void triangulateConvexPolyVertical(directedLine* topV, directedLine* botV, primStream *pStream) argument
111 for(tempV = topV; tempV != botV; tempV = tempV->getNext())
116 for(tempV = botV; tempV != topV; tempV = tempV->getNext())
136 for(tempV = topV; tempV != botV; tempV = tempV->getNext())
147 for(tempV = topV->getPrev(); tempV != botV->getPrev(); tempV = tempV->getPrev())
216 directedLine* botV; local in function:triangulateConvexPoly
219 topV = botV = polygon;
227 if(compV2InY(botV->head(), tempV->head())>0) {
229 botV = tempV;
233 for(tempV = topV; tempV != botV; temp
266 drawCorners(Real * topV,Real * botV,vertexArray * leftChain,vertexArray * rightChain,gridBoundaryChain * leftGridChain,gridBoundaryChain * rightGridChain,Int gridIndex1,Int gridIndex2,Int leftCornerWhere,Int leftCornerIndex,Int rightCornerWhere,Int rightCornerIndex,Int bot_leftCornerWhere,Int bot_leftCornerIndex,Int bot_rightCornerWhere,Int bot_rightCornerIndex) argument
346 toVertexArrays(directedLine * topV,directedLine * botV,vertexArray & leftChain,vertexArray & rightChain) argument
372 findTopAndBot(directedLine * polygon,directedLine * & topV,directedLine * & botV) argument
388 findGridChains(directedLine * topV,directedLine * botV,gridWrap * grid,gridBoundaryChain * & leftGridChain,gridBoundaryChain * & rightGridChain) argument
1304 directedLine* botV; local in function:sampleMonoPoly
[all...]
H A DmonoTriangulation.cc585 directedLine* botV; local in function:monoTriangulationFun
586 topV = botV = monoPolygon;
592 if(compFun(botV->head(), tempV->head())>0) {
593 botV = tempV;
602 for(tempV = topV->getNext(); tempV != botV; tempV = tempV->getNext())
610 for(tempV = topV->getPrev(); tempV != botV; tempV = tempV->getPrev())
616 for(i=botV->get_npoints()-2; i>=1; i--){
621 monoTriangulationRecFun(topV->head(), botV->head(), &inc_chain, 0,
634 directedLine* botV; local in function:monoTriangulation
635 topV = botV
[all...]
H A DsampleMonoPoly.h156 directedLine*& botV);
161 void toVertexArrays(directedLine* topV, directedLine* botV, vertexArray& leftChain, vertexArray& rightChain);
164 Real* topV, Real* botV,
/xsrc/external/mit/glu/dist/src/libnurbs/internals/
H A DmonoTriangulationBackend.cc261 Arc_ptr botV; local in function:monoTriangulationFunBackend
262 topV = botV = loop;
268 if(compFun(botV->tail(), tempV->tail())>0) {
269 botV = tempV;
278 for(tempV = topV->next; tempV != botV; tempV = tempV->next)
286 for(tempV = topV->prev; tempV != botV; tempV = tempV->prev)
292 for(i=botV->pwlArc->npts-2; i>=1; i--){
296 monoTriangulationRecFunBackend(topV->tail(), botV->tail(), &inc_chain, 0, &dec_chain, 0, compFun, backend);

Completed in 6 milliseconds