Ray-casting algorithm: Difference between revisions

{

/* should assert p->n > 1 */

vec *pv;

double min_x, max_x, min_y, max_y;

 

for (i = 0; i < p->n; i++) {

min_x = dist(v, p->v[i], p->v[k], tol);

if (min_x < tol) return 0;

for (i = 0; i < p->n; i++) {

k = (i + 1) % p->n;

 

/* picked a bad point, ray got too close to vertex.

re-pick */

 

}

if (i == p->n) break;