W dniu 2014-11-06 o 16:26, Borneq pisze:
> Zwykły uniq:

Mam:
Poly tmpPoly;
int newSize = polyIn->n - cntZeroLen;
tmpPoly.SetSize(newSize);
Point prevp,p0;
int ii=0;
for (int i = 0; i < polyIn->n; i++)
{
Point p = polyIn->pts[i];
if (i==0) p0=p;
if ((i==0) || (prevp.x!=p.x || prevp.y!=p.y))
{
if (ii<newSize)
{
tmpPoly.pts[ii] = polyIn->pts[i];
ii++;
prevp = p;
}
else
assert(p.x==p0.x && p.y==p0.y);
}
}