Fix for Issue 187
This commit is contained in:
parent
4748710177
commit
5f652cd660
@ -420,14 +420,12 @@ static void simplifyContour(rcIntArray& points, rcIntArray& simplified,
|
|||||||
// Round based on the segments in lexilogical order so that the
|
// Round based on the segments in lexilogical order so that the
|
||||||
// max tesselation is consistent regardles in which direction
|
// max tesselation is consistent regardles in which direction
|
||||||
// segments are traversed.
|
// segments are traversed.
|
||||||
|
const int n = bi < ai ? (bi+pn - ai) : (bi - ai);
|
||||||
|
if (n > 1)
|
||||||
|
{
|
||||||
if (bx > ax || (bx == ax && bz > az))
|
if (bx > ax || (bx == ax && bz > az))
|
||||||
{
|
|
||||||
const int n = bi < ai ? (bi+pn - ai) : (bi - ai);
|
|
||||||
maxi = (ai + n/2) % pn;
|
maxi = (ai + n/2) % pn;
|
||||||
}
|
|
||||||
else
|
else
|
||||||
{
|
|
||||||
const int n = bi < ai ? (bi+pn - ai) : (bi - ai);
|
|
||||||
maxi = (ai + (n+1)/2) % pn;
|
maxi = (ai + (n+1)/2) % pn;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
Loading…
x
Reference in New Issue
Block a user