/** * Sets the end point of the arrow. * * @param end * @return this Arrow */ public Arrow setEnd(final Point2D end) { getPoints().set(1, end); invalidatePolygon(); return this; }
/** * Sets the end point of the arrow. * * @param end * @return this Arrow */ public Arrow setEnd(final Point2D end) { getPoints().set(1, end); invalidatePolygon(); return this; }
/** * Sets the start point of the arrow. * * @param start * @return this Arrow */ public Arrow setStart(final Point2D start) { getPoints().set(0, start); invalidatePolygon(); return this; }
/** * Sets the start point of the arrow. * * @param start * @return this Arrow */ public Arrow setStart(Point2D start) { getPoints().set(0, start); invalidatePolygon(); return this; }
/** * Sets the start point of the arrow. * * @param start * @return this Arrow */ public Arrow setStart(final Point2D start) { getPoints().set(0, start); invalidatePolygon(); return this; }
/** * Sets the end point of the arrow. * * @param end * @return this Arrow */ public Arrow setEnd(Point2D end) { getPoints().set(1, end); invalidatePolygon(); return this; }
/** * Sets the end point of the arrow. * * @param end * @return this Arrow */ public Arrow setEnd(final Point2D end) { getPoints().set(1, end); invalidatePolygon(); return this; }
/** * Sets the start point of the arrow. * * @param start * @return this Arrow */ public Arrow setStart(final Point2D start) { getPoints().set(0, start); invalidatePolygon(); return this; }
public static final Point2DArray removeInnerPoints(final Point2D c, final Set<Point2D>[] pointSet) { final Point2DArray points = new Point2DArray(); int i = 0; for (final Set<Point2D> set : pointSet) { double furthestDistance = -1; if ((set != null) && !set.isEmpty()) { for (final Point2D p : set) { final double currentDistance = p.distance(c); if (currentDistance > furthestDistance) { furthestDistance = currentDistance; points.set(i, p); } } i++; } } return points; }
public static final Point2DArray removeInnerPoints(final Point2D c, final Set<Point2D>[] pointSet) { final Point2DArray points = new Point2DArray(); int i = 0; for (final Set<Point2D> set : pointSet) { double furthestDistance = -1; if ((set != null) && !set.isEmpty()) { for (final Point2D p : set) { final double currentDistance = p.distance(c); if (currentDistance > furthestDistance) { furthestDistance = currentDistance; points.set(i, p); } } i++; } } return points; }
public static final Point2DArray removeInnerPoints(final Point2D c, final Set<Point2D>[] pointSet) { final Point2DArray points = new Point2DArray(); int i = 0; for (final Set<Point2D> set : pointSet) { double furthestDistance = -1; if ((set != null) && !set.isEmpty()) { for (final Point2D p : set) { final double currentDistance = p.distance(c); if (currentDistance > furthestDistance) { furthestDistance = currentDistance; points.set(i, p); } } i++; } } return points; }
public void correctTailWithOffset(Point2DArray points, double offset, Direction direction) { Point2D p0 = points.get(0); Point2D p1 = points.get(1); Point2D p = correctEndWithOffset(offset, direction, p0, p1, false); m_tailOffsetPoint = p; points.set(0, p); }
public void correctHeadWithOffset(Point2DArray points, double offset, Direction direction) { int size = points.size(); Point2D p0 = points.get(size - 2); Point2D p1 = points.get(size - 1); Point2D p = correctEndWithOffset(offset, direction, p0, p1, true); m_headOffsetPoint = p; points.set(size - 1, p); }
Geometry.drawArcJoinedLines(path, list.copy().set(size - 1, m_tailOffsetPoint), corner);
Geometry.drawArcJoinedLines(path, list.copy().set(size - 1, m_tailOffsetPoint), corner);
Geometry.drawArcJoinedLines(path, list.copy().set(size - 1, m_tailOffsetPoint), corner);