a.samsonkin
/
DotRecastNetSim
forked from bit/DotRecastNetSim
1
0
Fork 0
Code Pull Requests Activity

fixed a typo (countour -> contour)

This commit is contained in:
ikpil 2023-04-02 11:04:37 +09:00
parent 6e7f1925ad
commit 0c0ac0bde8
1 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
src/DotRecast.Recast/RecastContour.cs
View File

@ -493,8 +493,7 @@ namespace DotRecast.Recast
return (area + 1) / 2; return (area + 1) / 2;
} }
private static bool intersectSegCountour(int d0, int d1, int i, int n, int[] verts, int[] d0verts, private static bool intersectSegContour(int d0, int d1, int i, int n, int[] verts, int[] d0verts, int[] d1verts)
int[] d1verts)
{ {
// For each edge (k,k+1) of P // For each edge (k,k+1) of P
int[] pverts = new int[4 * 4]; int[] pverts = new int[4 * 4];
@ -730,10 +729,10 @@ namespace DotRecast.Recast
for (int j = 0; j < ndiags; j++) for (int j = 0; j < ndiags; j++)
{ {
int pt = diags[j].vert * 4; int pt = diags[j].vert * 4;
bool intersect = intersectSegCountour(pt, corner, diags[j].vert, outline.nverts, outline.verts, bool intersect = intersectSegContour(pt, corner, diags[j].vert, outline.nverts, outline.verts,
outline.verts, hole.verts); outline.verts, hole.verts);
for (int k = i; k < region.nholes && !intersect; k++) for (int k = i; k < region.nholes && !intersect; k++)
intersect |= intersectSegCountour(pt, corner, -1, region.holes[k].contour.nverts, intersect |= intersectSegContour(pt, corner, -1, region.holes[k].contour.nverts,
region.holes[k].contour.verts, outline.verts, hole.verts); region.holes[k].contour.verts, outline.verts, hole.verts);
if (!intersect) if (!intersect)
{ {