Cross Reference: /inkscape/src/libavoid/visibility.cpp

Lines Matching refs:point
122 void vertexVisibility(VertInf *point, VertInf *partner, bool knownNew,
125     Router *router = point->_router;
126     const VertID& pID = point->id;
133         point->removeFromGraph();
138         router->generateContains(point);
143         vertexSweep(point);
156             EdgeInf::checkEdgeVisibility(point, k, knownNew);
160             EdgeInf::checkEdgeVisibility(point, partner, knownNew);
181             double x = vInf->point.x - centerPoint.x;
182             double y = vInf->point.y - centerPoint.y;
185             distance = euclideanDist(centerPoint, vInf->point);
193                 // distance from the point we are sweeping around.
260                 dist2(euclideanDist(vInf2->point, centerPoint)),
302             if (p.vInf->point == vInf1->point)
307             else if (p.vInf->point == vInf2->point)
317                 int result = rayIntersectPoint(vInf1->point, vInf2->point,
318                         centerPoint, p.vInf->point, &(pp.x), &(pp.y));
376 static bool sweepVisible(SweepEdgeList& T, const PointPair& point, 
385     Router *router = point.vInf->_router;
392         if ((point.vInf->point == closestIt->vInf1->point) ||
393                 (point.vInf->point == closestIt->vInf2->point))
407     if (! point.vInf->id.isShape )
411         ShapeSet& rss = router->contains[point.vInf->id];
418                 if (point.distance > closestIt->angleDist)
422                 else if ((point.distance == closestIt->angleDist) && 
438         // Just test to see if this point is closer than the closest 
440         if (point.distance > closestIt->angleDist)
444         else if ((point.distance == closestIt->angleDist) && 
458         Point &e1 = (*closestIt).vInf1->point;
459         Point &e2 = (*closestIt).vInf2->point;
478     Point& pPoint = vert->point;
497             // Don't include the center point itself.
554         Point xaxis(DBL_MAX, centerInf->point.y);
559                 (vecDir(centerInf->point, xaxis, kPrev->point) == AHEAD))
561             if (segmentIntersect(centerInf->point, xaxis, kPrev->point, 
562                         k->point))
567             if ((vecDir(kPrev->point, k->point, centerInf->point) == 0) &&
568                     inBetween(kPrev->point, k->point, centerInf->point))
575                 (vecDir(centerInf->point, xaxis, kNext->point) == AHEAD))
577             if (segmentIntersect(centerInf->point, xaxis, kNext->point, 
578                         k->point))
583             if ((vecDir(kNext->point, k->point, centerInf->point) == 0) &&
584                     inBetween(kNext->point, k->point, centerInf->point))
605         Point&  currPt = currInf->point;
640                     centerInf->shPrev->point, centerPoint,
641                     centerInf->shNext->point, currInf->point);
646                     currInf->shPrev->point, currInf->point,
647                     currInf->shNext->point, centerPoint);
695                 Point& prevPt = currInf->shPrev->point;
711                 Point& nextPt = currInf->shNext->point;