public void splitAt(double length, Coordinate endPt) { double actualLen = getConstrainedLength(length); double frac = actualLen / segLen; if (endPt.equals2D(seg.p0)) splitPt = seg.pointAlong(frac); else splitPt = pointAlongReverse(seg, frac); }
public void splitAt(Coordinate pt) { // check that given pt doesn't violate min length double minFrac = minimumLen / segLen; if (pt.distance(seg.p0) < minimumLen) { splitPt = seg.pointAlong(minFrac); return; } if (pt.distance(seg.p1) < minimumLen) { splitPt = pointAlongReverse(seg, minFrac); return; } // passes minimum distance check - use provided point as split pt splitPt = pt; }
public void splitAt(double length, Coordinate endPt) { double actualLen = getConstrainedLength(length); double frac = actualLen / segLen; if (endPt.equals2D(seg.p0)) splitPt = seg.pointAlong(frac); else splitPt = pointAlongReverse(seg, frac); }
public void splitAt(Coordinate pt) { // check that given pt doesn't violate min length double minFrac = minimumLen / segLen; if (pt.distance(seg.p0) < minimumLen) { splitPt = seg.pointAlong(minFrac); return; } if (pt.distance(seg.p1) < minimumLen) { splitPt = pointAlongReverse(seg, minFrac); return; } // passes minimum distance check - use provided point as split pt splitPt = pt; }