Docjar: A Java Source and Docuemnt Enginecom.*    java.*    javax.*    org.*    all    new    plug-in

Quick Search    Search Deep

Uses of Class
com.port80.graph.dot.impl.DotPoint

Uses of DotPoint in com.port80.graph.dot.impl
 

Fields in com.port80.graph.dot.impl declared as DotPoint
(package private)  DotPoint ShortestPath.PointLink.pt
           
(package private)  DotPoint RouteSpline.BezierPt.a
           
(package private)  DotPoint RouteSpline.BezierPt.b
           
(package private)  DotPoint Route.TextLabel.dimen
           
(package private)  DotPoint[] DotSpline.pts
           
(package private)  DotPoint DotSpline.sp
           
(package private)  DotPoint DotSpline.ep
          Tail end point (ie.
(package private)  DotPoint DotRoute.tail0
           
(package private)  DotPoint DotRoute.tail1
          Tail arrow origin (on the spline).
(package private)  DotPoint DotRoute.head0
          Tail arrow head (on vertex).
(package private)  DotPoint DotRoute.head1
          Head arrow origin (on spline).
 DotPoint[] DotPolyline.pts
           
 

Methods in com.port80.graph.dot.impl that return DotPoint
private  DotPoint RouteSpline.normalize(DotPoint v)
          Normalize vector to 'v' to unit length.
private  DotPoint RouteSpline.add(DotPoint p1, DotPoint p2)
           
private  DotPoint RouteSpline.sub(DotPoint p1, DotPoint p2)
           
private  DotPoint RouteSpline.scale(DotPoint p, double c)
           
 DotPoint DotSpline.get(int n)
           
 DotPoint DotRoute.getStartPt()
           
 DotPoint DotRoute.getEndPt()
           
 DotPoint DotPolyline.get(int i)
           
 

Methods in com.port80.graph.dot.impl with parameters of type DotPoint
static int ShortestPath.find(DotPolyline bound, DotPoint[] endpts, DotPolyline ret)
           
 int ShortestPath.shortestPath(DotPolyline bound, DotPoint[] endpts, DotPolyline ret)
           
private static int ShortestPath.ccw(DotPoint p1, DotPoint p2, DotPoint p3)
           
private static boolean ShortestPath.intersects(DotPoint a, DotPoint b, DotPoint c, DotPoint d)
           
private static boolean ShortestPath.between(DotPoint a, DotPoint b, DotPoint c)
           
 boolean ShortestPath.Triangle.contains(DotPoint pt)
           
 boolean RouteSpline.routeSpline(DotPolyline ret, DotPolyline bound, DotPolyline input, DotPoint tangent0, DotPoint tangent3)
          Route spline to approx.
private  boolean RouteSpline.routeSpline1(DotPolyline ret, DotPolyline bound, DotPoint[] ipts, int istart, int isize, DotPoint tangent0, DotPoint tangent1)
          Route spline with recursive splitting.
private  com.port80.util.struct.DoublePair RouteSpline.makeSpline(DotPoint[] ipts, int istart, int isize, RouteSpline.BezierPt[] cpts)
          Interpolate the two middle control points of the Bezier curve.
private  boolean RouteSpline.splineFits(DotPolyline ret, DotPolyline bound, DotPoint[] ipts, int istart, int isize, DotPoint p0, DotPoint tan0, DotPoint p3, DotPoint tan3)
          Check if spline given by 'p0','v0','p3','v3' fit inside the bounding polygon with 4/3,2/3 and 0 curvature.
private  boolean RouteSpline.splineIsInside(DotPolyline bound, DotPoint[] pts)
          Check if spline given by 'pts' lies inside the bounding polygon by looking for intersections of the spline with the polygon.
private  int RouteSpline.splineIntersectsLine(DotPoint[] pts, DotLine line, double[] roots)
           
private  double RouteSpline.lineLength(DotPoint[] p, int start, int size)
          Determine total length of polyline p[istart]..p[istart+n].
private  DotPoint RouteSpline.normalize(DotPoint v)
          Normalize vector to 'v' to unit length.
private  DotPoint RouteSpline.add(DotPoint p1, DotPoint p2)
           
private  DotPoint RouteSpline.sub(DotPoint p1, DotPoint p2)
           
private  DotPoint RouteSpline.scale(DotPoint p, double c)
           
private  double RouteSpline.distsq(DotPoint p1, DotPoint p2)
           
private  double RouteSpline.dist(DotPoint p1, DotPoint p2)
           
private  double RouteSpline.dot(DotPoint p1, DotPoint p2)
           
private  double Route.dist(DotPoint p1, DotPoint p2)
           
private  double Route.dist2(DotPoint p1, DotPoint p2)
           
 void DotSpline.add(DotPoint p)
           
 void DotSpline.bezierAt(int index, double t, DotPoint ret)
          Evaluate Bezier point on segment start at 'index' at parameter value 't'.
 boolean DotSpline.intersection(DotPoint ret, java.awt.Shape shape, int index)
          Binary search in 't' domain for intersection of the spline segment starting from 'index' with shape.
 void DotSpline.splitAt(double t, int index, DotSpline left, DotSpline right, DotPoint ret)
          Split the Bezier curve, started at given index, at a particular parameter value.
 void DotPolyline.add(DotPoint pt)
           
 void DotLine.set(DotPoint a, DotPoint b)
           
 

Constructors in com.port80.graph.dot.impl with parameters of type DotPoint
ShortestPath.PointLink(DotPoint pt)
           
IntPoint(DotPoint p)
           
DotRoute(java.awt.geom.GeneralPath p, DotPoint s0, DotPoint s1, DotPoint e0, DotPoint e1, boolean isReversed)
           
DotPoint(DotPoint p)