Class CurvePath<T>

constructor

• new CurvePath<T>(): CurvePath<T>

• Type Parameters

  • T extends Vector<T>

  Returns CurvePath<T>

arcLengthDivisions

cacheArcLengths

needsUpdate

computeFrenetFrames

• computeFrenetFrames(segments, closed): {
      binormals: Vector3[];
      normals: Vector3[];
      tangents: Vector3[];
  }

• Parameters

  • segments: number

  • closed: boolean

  Returns {
      binormals: Vector3[];
      normals: Vector3[];
      tangents: Vector3[];
  }

  • binormals: Vector3[]

  • normals: Vector3[]

  • tangents: Vector3[]

getLengths

• getLengths(divisions?): number[]

• Get list of cumulative segment lengths

  Parameters

  • Optional divisions: number

  Returns number[]

getPointAt

• getPointAt(u, optionalTarget?): T

• Get point at relative position in curve according to arc length Returns a vector for point at relative position in curve according to arc length

  Parameters

  • u: number

    [0 .. 1]

  • Optional optionalTarget: T

  Returns T

getResolution

• getResolution(divisions): number

• Parameters

  • divisions: number

  Returns number

getTangent

• getTangent(t, optionalTarget): T

• Returns a unit vector tangent at t. If the subclassed curve do not implement its tangent derivation, 2 points a small delta apart will be used to find its gradient which seems to give a reasonable approximation getTangent(t: number, optionalTarget?: T): T;

  Parameters

  • t: number

  • optionalTarget: T

  Returns T

getTangentAt

• getTangentAt(u, optionalTarget): T

• Returns tangent at equidistance point u on the curve getTangentAt(u: number, optionalTarget?: T): T;

  Parameters

  • u: number

  • optionalTarget: T

  Returns T

getUtoTmapping

• getUtoTmapping(u, distance?): number

• Given u ( 0 .. 1 ), get a t to find p. This gives you points which are equi distance

  Parameters

  • u: number

  • Optional distance: number

  Returns number