HVertex prev = vertex(numv-1);
HVertex pprev = vertex(numv>1? numv-2 : 0);
for(int i=0; i<numv; ++i) {
HVertex curr = vertex(i);
if(curr.intersectTest(pprev,prev, u,v, openPath)) isIn = !isIn;
pprev = prev;
prev = curr;
if(openPath) openPath = false;
}
return isIn;