Lines Matching refs:point
94 // the highest timeStamp. This corresponds to the furthest point
146 connRoute.ps[routeSize - 1] = inf3->point;
147 connRoute.ps[routeSize - 2] = inf2->point;
151 connRoute.ps[routeSize] = done[curr].inf->point;
159 // possibly the previous point (inf1) [from inf1--inf2], return a
179 Point p1 = inf1->point;
180 Point p2 = inf2->point;
181 Point p3 = inf3->point;
353 // Target point is back in the direction of the first point,
390 // prevIndex values for each ANode which point back to the previous ANode's
440 Node.h = estimatedCost(lineRef, NULL, Node.inf->point,
441 tar->point);
446 double edgeDist = dist(BestNode.inf->point, curr->point);
452 Node.h = estimatedCost(lineRef, &(BestNode.inf->point),
453 Node.inf->point, tar->point);
482 Node.h = estimatedCost(lineRef, NULL, Node.inf->point, tar->point);
518 db_printf(" %g %g ", BestNode.inf->point.x, BestNode.inf->point.y);
523 db_printf(" %g %g", prevInf->point.x, prevInf->point.y);
540 (int) curr.inf->point.x + canx,
541 (int) curr.inf->point.y + cany,
545 (int) BestNode.inf->point.x + canx,
546 (int) BestNode.inf->point.y + cany,
553 (int) BestNode.inf->point.x + canx,
554 (int) BestNode.inf->point.y + cany,
557 (int) BestNode.inf->point.x + canx,
558 (int) BestNode.inf->point.y + cany,
564 (int) curr.inf->point.x + canx,
565 (int) curr.inf->point.y + cany,
568 (int) curr.inf->point.x + canx,
569 (int) curr.inf->point.y + cany,
658 Node.h = estimatedCost(lineRef, &(BestNode.inf->point),
659 Node.inf->point, tar->point);
665 db_printf("-- Adding: %g %g ", Node.inf->point.x,
666 Node.inf->point.y);