ink1 = ink(edges, ia[i+1]-ia[i], pick, &ink0, &meet1, &meet2, angle_param, angle);
if (Verbose && DEBUG) fprintf(stderr,"finish calling ink2...\n");
assert(fabs(ink1 - cgrid->inks[i])<=MAX(TOL, TOL*ink1) && ink1 - ink0 <= TOL);
+ assert(ink1 < 1000 * ink0); /* assert that points were found */
wgt_all = 0.;
if (ia[i+1]-ia[i] > 1){
for (j = ia[i]; j < ia[i+1]; j++){
ink1 = ink(edges, ia[i+1]-ia[i], pick, &ink0, &meet1, &meet2, angle_param, angle);
if (Verbose && DEBUG) fprintf(stderr,"done calling ink3...\n");
assert(fabs(ink1 - cgrid->inks[i])<=MAX(TOL, TOL*ink1) && ink1 - ink0 <= TOL);
+ assert(ink1 < 1000 * ink0); /* assert that points were found */
xx[i*4 + 0] = meet1.x;
xx[i*4 + 1] = meet1.y;
xx[i*4 + 2] = meet2.x;
/* no point can be found that satisfies the angular constraints, so we give up and set ink to a large value */
if (Verbose && 0) fprintf(stderr,"no point satisfying any angle constraints can be found. cbeg=%f cend=%f\n",cbegin,cend);
inkUsed = 1000*(*ink0);
- *meet1 = *meet2 = mid;
free (sources);
free (targets);
return inkUsed;