| 53 |
|
|
| 54 |
|
for (p=0;p<n;p++) |
| 55 |
|
{ |
| 56 |
< |
if( (p == u) || (p == v) || (p == w) ) continue; |
| 56 |
> |
if( (p == u) | (p == v) | (p == w) ) continue; |
| 57 |
|
Px = contour->v[V[p]].mX; |
| 58 |
|
Py = contour->v[V[p]].mY; |
| 59 |
|
if (insideTriangle(Ax,Ay,Bx,By,Cx,Cy,Px,Py)) return false; |
| 146 |
|
for(m=0, v=nv-1; nv>2; ) |
| 147 |
|
{ |
| 148 |
|
/* if we loop, it is probably a non-simple polygon */ |
| 149 |
< |
if (0 >= (count--)) |
| 149 |
> |
if (0 >= count--) |
| 150 |
|
{ |
| 151 |
< |
/* Triangulate: ERROR - probable bad polygon! */ |
| 151 |
> |
/* Triangulate: ERROR - probable bad polygon */ |
| 152 |
|
return false; |
| 153 |
|
} |
| 154 |
|
|
| 172 |
|
/* remove v from remaining polygon */ |
| 173 |
|
for(s=v,t=v+1;t<nv;s++,t++) V[s] = V[t]; nv--; |
| 174 |
|
|
| 175 |
< |
/* resest error detection counter */ |
| 175 |
> |
/* reset error detection counter */ |
| 176 |
|
count = 2*nv; |
| 177 |
|
} |
| 178 |
|
} |
