Lines Matching refs:dec_chain
164 vertexArray* dec_chain, Int dec_current, Int dec_end,
167 pStream->triangle(topVertex, inc_chain->getVertex(inc_current), dec_chain->getVertex(dec_current));
170 triangulateXYMonoTB(inc_end-inc_current+1, inc_chain->getArray()+inc_current, dec_end-dec_current+1, dec_chain->getArray()+dec_current, pStream);
172 pStream->triangle(botVertex, dec_chain->getVertex(dec_end), inc_chain->getVertex(inc_end));
311 static int chainConcave(vertexArray* dec_chain, Int dec_current, Int dec_end)
318 if(area(dec_chain->getVertex(i), dec_chain->getVertex(i+1), dec_chain->getVertex(i+2)) >0)
326 vertexArray* dec_chain, Int dec_current, Int dec_end,
334 vertexArray* dec_chain, Int dec_current, Int dec_end,
368 sline = new sampledLine(botVertex, dec_chain->getVertex(dec_end));
373 sline = new sampledLine(dec_chain->getVertex(i), dec_chain->getVertex(i-1));
377 sline = new sampledLine(dec_chain->getVertex(dec_current), topVertex);
381 else //dec_chain is empty
461 dec_chain, dec_current, dec_end,
468 area(dec_chain->getVertex(dec_current),
472 && chainConcave(dec_chain, dec_current, dec_end)
473 && area(inc_chain->getVertex(inc_end), botVertex, dec_chain->getVertex(dec_end)) >=0
478 dec_chain, dec_current, dec_end,
484 dec_chain, dec_current, dec_end,
490 *same for dec_chain
494 vertexArray* dec_chain, Int dec_current, Int dec_end,
505 dec_array = dec_chain->getArray();
509 /*process all the vertices on the dec_chain*/
516 else if(dec_current> dec_end) /*no more vertices on dec_chain*/
533 dec_array = dec_chain -> getArray();
535 /*if top of inc_chain is 'lower' than top of dec_chain, process all the
536 *vertices on the dec_chain which are higher than top of inc_chain
553 dec_chain, i, dec_end,
571 dec_chain, dec_current,dec_end,
609 vertexArray dec_chain(20);
613 dec_chain.appendVertex(tempV->getVertex(i));
617 dec_chain.appendVertex(tempV->getVertex(i));
620 if (!(0 == inc_chain.getNumElements() && 0 == dec_chain.getNumElements())) {
622 &dec_chain, 0, compFun, pStream);
657 vertexArray dec_chain(20);
661 dec_chain.appendVertex(tempV->getVertex(i));
665 dec_chain.appendVertex(tempV->getVertex(i));
668 monoTriangulationRec(topV->head(), botV->head(), &inc_chain, 0, &dec_chain, 0, pStream);
736 vertexArray* dec_chain, Int dec_current, Int dec_end,
740 assert( inc_chain != NULL && dec_chain != NULL);
750 assert( ! ( (inc_chain==NULL) && (dec_chain==NULL)));
755 dec_array = dec_chain->getArray();
759 /*process all the vertices on the dec_chain*/
767 else if(dec_current> dec_end) /*no more vertices on dec_chain*/
783 dec_array = dec_chain -> getArray();
785 /*if top of inc_chain is 'lower' than top of dec_chain, process all the
786 *vertices on the dec_chain which are higher than top of inc_chain
803 dec_chain, i, dec_end,
822 dec_chain, dec_current,dec_end,
834 vertexArray* dec_chain, Int dec_current,
838 assert( inc_chain != NULL && dec_chain != NULL);
840 dec_current>=dec_chain->getNumElements()));
846 assert( ! ( (inc_chain==NULL) && (dec_chain==NULL)));
851 dec_array = dec_chain->getArray();
852 dec_nVertices = dec_chain->getNumElements();
856 /*process all the vertices on the dec_chain*/
864 else if(dec_current>= dec_chain->getNumElements()) /*no more vertices on dec_chain*/
881 dec_array = dec_chain -> getArray();
883 dec_nVertices= dec_chain->getNumElements();
884 /*if top of inc_chain is 'lower' than top of dec_chain, process all the
885 *vertices on the dec_chain which are higher than top of inc_chain
902 dec_chain, i,
921 dec_chain, dec_current,
931 vertexArray* dec_chain, Int dec_current,
934 assert( inc_chain != NULL && dec_chain != NULL);
936 dec_current>=dec_chain->getNumElements()));
942 assert( ! ( (inc_chain==NULL) && (dec_chain==NULL)));
947 dec_array = dec_chain->getArray();
948 dec_nVertices = dec_chain->getNumElements();
952 /*process all the vertices on the dec_chain*/
960 else if(dec_current>= dec_chain->getNumElements()) /*no more vertices on dec_chain*/
977 dec_array = dec_chain -> getArray();
979 dec_nVertices= dec_chain->getNumElements();
980 /*if top of inc_chain is 'lower' than top of dec_chain, process all the
981 *vertices on the dec_chain which are higher than top of inc_chain
998 dec_chain, i,
1016 dec_chain, dec_current,
1027 *two monotone chains: inc_chain, and dec_chain. The edges of the increasing chain (inc_chain)
1028 *is ordered by following pointer: next, while the edges of the decreasing chain (dec_chain)
1031 * dec_index index the vertex which is the toppest of the dec_chain which we are handling currently.
1034 directedLine* dec_chain, Int dec_index,
1043 assert(inc_chain != NULL && dec_chain != NULL);
1048 for(i=dec_index; i< dec_chain->get_npoints(); i++){
1049 rChain.processNewVertex(dec_chain->getVertex(i), pStream);
1051 for(temp = dec_chain->getPrev(); temp != botVertex; temp = temp->getPrev())
1058 else if(dec_chain==botVertex) {
1072 if(compV2InY(inc_chain->getVertex(inc_index), dec_chain->getVertex(dec_index)) <=0) {
1075 temp = dec_chain;
1098 while( compV2InY(temp->getVertex(tempIndex), dec_chain->getVertex(dec_index))>0){
1111 rChain.outputFan(dec_chain->getVertex(dec_index), pStream);
1112 monoTriangulationRec(temp, tempIndex, dec_chain, dec_index, oldtemp, oldtempIndex, botVertex, pStream);