Spaces:
Running
Running
File size: 4,501 Bytes
2b7aae2 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 | import { Curve } from './Curve.js';
import * as Curves from '../curves/Curves.js';
/**************************************************************
* Curved Path - a curve path is simply a array of connected
* curves, but retains the api of a curve
**************************************************************/
class CurvePath extends Curve {
constructor() {
super();
this.type = 'CurvePath';
this.curves = [];
this.autoClose = false; // Automatically closes the path
}
add(curve) {
this.curves.push(curve);
}
closePath() {
// Add a line curve if start and end of lines are not connected
const startPoint = this.curves[0].getPoint(0);
const endPoint = this.curves[this.curves.length - 1].getPoint(1);
if (!startPoint.equals(endPoint)) {
this.curves.push(new Curves['LineCurve'](endPoint, startPoint));
}
}
// To get accurate point with reference to
// entire path distance at time t,
// following has to be done:
// 1. Length of each sub path have to be known
// 2. Locate and identify type of curve
// 3. Get t for the curve
// 4. Return curve.getPointAt(t')
getPoint(t, optionalTarget) {
const d = t * this.getLength();
const curveLengths = this.getCurveLengths();
let i = 0;
// To think about boundaries points.
while (i < curveLengths.length) {
if (curveLengths[i] >= d) {
const diff = curveLengths[i] - d;
const curve = this.curves[i];
const segmentLength = curve.getLength();
const u = segmentLength === 0 ? 0 : 1 - diff / segmentLength;
return curve.getPointAt(u, optionalTarget);
}
i++;
}
return null;
// loop where sum != 0, sum > d , sum+1 <d
}
// We cannot use the default THREE.Curve getPoint() with getLength() because in
// THREE.Curve, getLength() depends on getPoint() but in THREE.CurvePath
// getPoint() depends on getLength
getLength() {
const lens = this.getCurveLengths();
return lens[lens.length - 1];
}
// cacheLengths must be recalculated.
updateArcLengths() {
this.needsUpdate = true;
this.cacheLengths = null;
this.getCurveLengths();
}
// Compute lengths and cache them
// We cannot overwrite getLengths() because UtoT mapping uses it.
getCurveLengths() {
// We use cache values if curves and cache array are same length
if (this.cacheLengths && this.cacheLengths.length === this.curves.length) {
return this.cacheLengths;
}
// Get length of sub-curve
// Push sums into cached array
const lengths = [];
let sums = 0;
for (let i = 0, l = this.curves.length; i < l; i++) {
sums += this.curves[i].getLength();
lengths.push(sums);
}
this.cacheLengths = lengths;
return lengths;
}
getSpacedPoints(divisions = 40) {
const points = [];
for (let i = 0; i <= divisions; i++) {
points.push(this.getPoint(i / divisions));
}
if (this.autoClose) {
points.push(points[0]);
}
return points;
}
getPoints(divisions = 12) {
const points = [];
let last;
for (let i = 0, curves = this.curves; i < curves.length; i++) {
const curve = curves[i];
const resolution =
curve && curve.isEllipseCurve
? divisions * 2
: curve && (curve.isLineCurve || curve.isLineCurve3)
? 1
: curve && curve.isSplineCurve
? divisions * curve.points.length
: divisions;
const pts = curve.getPoints(resolution);
for (let j = 0; j < pts.length; j++) {
const point = pts[j];
if (last && last.equals(point)) continue; // ensures no consecutive points are duplicates
points.push(point);
last = point;
}
}
if (this.autoClose && points.length > 1 && !points[points.length - 1].equals(points[0])) {
points.push(points[0]);
}
return points;
}
copy(source) {
super.copy(source);
this.curves = [];
for (let i = 0, l = source.curves.length; i < l; i++) {
const curve = source.curves[i];
this.curves.push(curve.clone());
}
this.autoClose = source.autoClose;
return this;
}
toJSON() {
const data = super.toJSON();
data.autoClose = this.autoClose;
data.curves = [];
for (let i = 0, l = this.curves.length; i < l; i++) {
const curve = this.curves[i];
data.curves.push(curve.toJSON());
}
return data;
}
fromJSON(json) {
super.fromJSON(json);
this.autoClose = json.autoClose;
this.curves = [];
for (let i = 0, l = json.curves.length; i < l; i++) {
const curve = json.curves[i];
this.curves.push(new Curves[curve.type]().fromJSON(curve));
}
return this;
}
}
export { CurvePath };
|