text
stringlengths 0
2.2M
|
---|
ntris++;
|
// Removes P[i1] by copying P[i+1]...P[n-1] left one index.
|
n--;
|
for (int k = i1; k < n; k++)
|
indices[k] = indices[k+1];
|
if (i1 >= n) i1 = 0;
|
i = prev(i1,n);
|
// Update diagonal flags.
|
if (diagonal(prev(i, n), i1, n, verts, indices))
|
indices[i] |= 0x8000;
|
else
|
indices[i] &= 0x7fff;
|
if (diagonal(i, next(i1, n), n, verts, indices))
|
indices[i1] |= 0x8000;
|
else
|
indices[i1] &= 0x7fff;
|
}
|
// Append the remaining triangle.
|
*dst++ = indices[0] & 0x7fff;
|
*dst++ = indices[1] & 0x7fff;
|
*dst++ = indices[2] & 0x7fff;
|
ntris++;
|
return ntris;
|
}
|
static int countPolyVerts(const unsigned short* p)
|
{
|
for (int i = 0; i < MAX_VERTS_PER_POLY; ++i)
|
if (p[i] == DT_TILECACHE_NULL_IDX)
|
return i;
|
return MAX_VERTS_PER_POLY;
|
}
|
inline bool uleft(const unsigned short* a, const unsigned short* b, const unsigned short* c)
|
{
|
return ((int)b[0] - (int)a[0]) * ((int)c[2] - (int)a[2]) -
|
((int)c[0] - (int)a[0]) * ((int)b[2] - (int)a[2]) < 0;
|
}
|
static int getPolyMergeValue(unsigned short* pa, unsigned short* pb,
|
const unsigned short* verts, int& ea, int& eb)
|
{
|
const int na = countPolyVerts(pa);
|
const int nb = countPolyVerts(pb);
|
// If the merged polygon would be too big, do not merge.
|
if (na+nb-2 > MAX_VERTS_PER_POLY)
|
return -1;
|
// Check if the polygons share an edge.
|
ea = -1;
|
eb = -1;
|
for (int i = 0; i < na; ++i)
|
{
|
unsigned short va0 = pa[i];
|
unsigned short va1 = pa[(i+1) % na];
|
if (va0 > va1)
|
dtSwap(va0, va1);
|
for (int j = 0; j < nb; ++j)
|
{
|
unsigned short vb0 = pb[j];
|
unsigned short vb1 = pb[(j+1) % nb];
|
if (vb0 > vb1)
|
dtSwap(vb0, vb1);
|
if (va0 == vb0 && va1 == vb1)
|
{
|
ea = i;
|
eb = j;
|
break;
|
}
|
}
|
}
|
// No common edge, cannot merge.
|
if (ea == -1 || eb == -1)
|
return -1;
|
// Check to see if the merged polygon would be convex.
|
unsigned short va, vb, vc;
|
va = pa[(ea+na-1) % na];
|
vb = pa[ea];
|
vc = pb[(eb+2) % nb];
|
if (!uleft(&verts[va*3], &verts[vb*3], &verts[vc*3]))
|
return -1;
|
va = pb[(eb+nb-1) % nb];
|
vb = pb[eb];
|
vc = pa[(ea+2) % na];
|
if (!uleft(&verts[va*3], &verts[vb*3], &verts[vc*3]))
|
return -1;
|
va = pa[ea];
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.