LineCurve class
class LineCurve extends Curve2D {
Vector2 v1, v2;
LineCurve( this.v1, this.v2 ) : super();
Vector2 getPoint( t ) {
Vector2 point = v2.clone().sub(v1);
point.scale( t ).add( v1 );
return point;
}
// Line curve is linear, so we can overwrite default getPointAt
Vector2 getPointAt( u ) => getPoint( u );
Vector2 getTangent( t ) => v2.clone().sub(v1).normalize();
}
Extends
Curve<Vector2> > Curve2D > LineCurve
Constructors
Properties
Methods
List getLengths({num divisions: null}) #
inherited from Curve
List getLengths( {num divisions: null} ) {
if (divisions == null) divisions = (_arcLengthDivisions != null) ? (_arcLengthDivisions): 200;
if ( cacheArcLengths != null
&& ( cacheArcLengths.length == divisions + 1 )
&& !needsUpdate) {
//console.log( "cached", this.cacheArcLengths );
return cacheArcLengths;
}
needsUpdate = false;
var cache = [];
var current;
var last = getPoint( 0.0 );
var sum = 0;
cache.add( 0 );
for ( var p = 1; p <= divisions; p ++ ) {
current = getPoint ( p / divisions );
var distance;
// TODO(nelsonsilva) - Must move distanceTo to IVector interface os create a new IHasDistance
if (current is Vector3) {
distance = (current as Vector3).absoluteError( last as Vector3 );
} else {
distance = (current as Vector2).absoluteError( last as Vector2);
}
sum += distance;
cache.add( sum );
last = current;
}
cacheArcLengths = cache;
return cache; // { sums: cache, sum:sum }; Sum is in the last element.
}
Vector2 getNormalVector(t) #
inherited from Curve2D
Vector2 getNormalVector( t ) {
var vec = this.getTangent( t );
return new Vector2( -vec.y , vec.x );
}
Vector2 getPoint(t) #
Vector2 getPoint( t ) {
Vector2 point = v2.clone().sub(v1);
point.scale( t ).add( v1 );
return point;
}
List<V> getPoints([num divisions = null, closedPath = false]) #
inherited from Curve
List<V> getPoints( [num divisions = null, closedPath = false] ) {
if (divisions == null) divisions = 5;
var d, pts = [];
for ( d = 0; d <= divisions; d ++ ) {
pts.add( this.getPoint( d / divisions ) );
}
return pts;
}
List<V> getSpacedPoints([num divisions = 5, closedPath = false]) #
inherited from Curve
List<V> getSpacedPoints( [num divisions = 5, closedPath = false] ) {
var d, pts = [];
for ( d = 0; d <= divisions; d ++ ) {
pts.add( this.getPointAt( d / divisions ) );
}
return pts;
}
V getTangentAt(u) #
inherited from Curve
V getTangentAt( u ) {
var t = getUtoTmapping( u );
return getTangent( t );
}
List<V> getUPoints([List uList, closedPath = false]) #
inherited from Curve
List<V> getUPoints( [List uList , closedPath = false] ) {
var pts = [];
for ( var u in uList ) {
pts.add( this.getPointAt( u ) );
}
return pts;
}
dynamic getUtoTmapping(u, {distance: null}) #
inherited from Curve
getUtoTmapping( u, {distance: null} ) {
var arcLengths = getLengths();
int i = 0, il = arcLengths.length;
var targetArcLength; // The targeted u distance value to get
if (distance != null) {
targetArcLength = distance;
} else {
targetArcLength = u * arcLengths[ il - 1 ];
}
//var time = Date.now();
// binary search for the index with largest value smaller than target u distance
var low = 0, high = il - 1, comparison;
while ( low <= high ) {
i = ( low + ( high - low ) / 2 ).floor().toInt(); // less likely to overflow, though probably not issue here, JS doesn't really have integers, all numbers are floats
comparison = arcLengths[ i ] - targetArcLength;
if ( comparison < 0 ) {
low = i + 1;
continue;
} else if ( comparison > 0 ) {
high = i - 1;
continue;
} else {
high = i;
break;
// DONE
}
}
i = high;
//console.log('b' , i, low, high, Date.now()- time);
if ( arcLengths[ i ] == targetArcLength ) {
var t = i / ( il - 1 );
return t;
}
// we could get finer grain at lengths, or use simple interpolatation between two points
var lengthBefore = arcLengths[ i ];
var lengthAfter = arcLengths[ i + 1 ];
var segmentLength = lengthAfter - lengthBefore;
// determine where we are between the 'before' and 'after' points
var segmentFraction = ( targetArcLength - lengthBefore ) / segmentLength;
// add that fractional amount to t
var t = ( i + segmentFraction ) / ( il -1 );
return t;
}