| 787 | |
| 788 | |
| 789 | void Subdiv2D::checkSubdiv() const |
| 790 | { |
| 791 | int i, j, total = (int)qedges.size(); |
| 792 | |
| 793 | for( i = 0; i < total; i++ ) |
| 794 | { |
| 795 | const QuadEdge& qe = qedges[i]; |
| 796 | |
| 797 | if( qe.isfree() ) |
| 798 | continue; |
| 799 | |
| 800 | for( j = 0; j < 4; j++ ) |
| 801 | { |
| 802 | int e = (int)(i*4 + j); |
| 803 | int o_next = nextEdge(e); |
| 804 | int o_prev = getEdge(e, PREV_AROUND_ORG ); |
| 805 | int d_prev = getEdge(e, PREV_AROUND_DST ); |
| 806 | int d_next = getEdge(e, NEXT_AROUND_DST ); |
| 807 | |
| 808 | // check points |
| 809 | CV_Assert( edgeOrg(e) == edgeOrg(o_next)); |
| 810 | CV_Assert( edgeOrg(e) == edgeOrg(o_prev)); |
| 811 | CV_Assert( edgeDst(e) == edgeDst(d_next)); |
| 812 | CV_Assert( edgeDst(e) == edgeDst(d_prev)); |
| 813 | |
| 814 | if( j % 2 == 0 ) |
| 815 | { |
| 816 | CV_Assert( edgeDst(o_next) == edgeOrg(d_prev)); |
| 817 | CV_Assert( edgeDst(o_prev) == edgeOrg(d_next)); |
| 818 | CV_Assert( getEdge(getEdge(getEdge(e,NEXT_AROUND_LEFT),NEXT_AROUND_LEFT),NEXT_AROUND_LEFT) == e ); |
| 819 | CV_Assert( getEdge(getEdge(getEdge(e,NEXT_AROUND_RIGHT),NEXT_AROUND_RIGHT),NEXT_AROUND_RIGHT) == e); |
| 820 | } |
| 821 | } |
| 822 | } |
| 823 | } |
| 824 | |
| 825 | } |
| 826 | |