File size: 7,993 Bytes
ae4627d | 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 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 | /* global QUnit */
import { QuadraticBezierCurve3 } from '../../../../../src/extras/curves/QuadraticBezierCurve3';
import { Vector3 } from '../../../../../src/math/Vector3';
export default QUnit.module( 'Extras', () => {
QUnit.module( 'Curves', () => {
QUnit.module( 'QuadraticBezierCurve3', ( hooks ) => {
let _curve = undefined;
hooks.before( function () {
_curve = new QuadraticBezierCurve3(
new Vector3( - 10, 0, 2 ),
new Vector3( 20, 15, - 5 ),
new Vector3( 10, 0, 10 )
);
} );
// INHERITANCE
QUnit.todo( 'Extending', ( assert ) => {
assert.ok( false, 'everything\'s gonna be alright' );
} );
// INSTANCING
QUnit.todo( 'Instancing', ( assert ) => {
assert.ok( false, 'everything\'s gonna be alright' );
} );
// PUBLIC STUFF
QUnit.todo( 'isQuadraticBezierCurve3', ( assert ) => {
assert.ok( false, 'everything\'s gonna be alright' );
} );
QUnit.todo( 'getPoint', ( assert ) => {
assert.ok( false, 'everything\'s gonna be alright' );
} );
// OTHERS
QUnit.test( 'Simple curve', ( assert ) => {
var curve = _curve;
var expectedPoints = [
new Vector3( - 10, 0, 2 ),
new Vector3( 2.5, 5.625, - 0.125 ),
new Vector3( 10, 7.5, 0.5 ),
new Vector3( 12.5, 5.625, 3.875 ),
new Vector3( 10, 0, 10 )
];
var points = curve.getPoints( expectedPoints.length - 1 );
assert.strictEqual( points.length, expectedPoints.length, 'Correct number of points' );
assert.deepEqual( points, expectedPoints, 'Correct points calculated' );
// symmetry
var curveRev = new QuadraticBezierCurve3(
curve.v2, curve.v1, curve.v0
);
points = curveRev.getPoints( expectedPoints.length - 1 );
assert.strictEqual( points.length, expectedPoints.length, 'Reversed: Correct number of points' );
assert.deepEqual( points, expectedPoints.reverse(), 'Reversed: Correct points curve' );
} );
QUnit.test( 'getLength/getLengths', ( assert ) => {
var curve = _curve;
var length = curve.getLength();
var expectedLength = 35.47294274967861;
assert.numEqual( length, expectedLength, 'Correct length of curve' );
var expectedLengths = [
0,
13.871057998581074,
21.62710402732536,
26.226696400568883,
34.91037361704809
];
var lengths = curve.getLengths( expectedLengths.length - 1 );
assert.strictEqual( lengths.length, expectedLengths.length, 'Correct number of segments' );
lengths.forEach( function ( segment, i ) {
assert.numEqual( segment, expectedLengths[ i ], 'segment[' + i + '] correct' );
} );
} );
QUnit.test( 'getPointAt', ( assert ) => {
var curve = _curve;
var expectedPoints = [
new Vector3( - 10, 0, 2 ),
new Vector3( - 0.4981634504454243, 4.427089043881476, 0.19308849757196012 ),
new Vector3( 6.149415812887238, 6.838853310980195, - 0.20278120208668637 ),
new Vector3( 10, 0, 10 )
];
var points = [
curve.getPointAt( 0, new Vector3() ),
curve.getPointAt( 0.3, new Vector3() ),
curve.getPointAt( 0.5, new Vector3() ),
curve.getPointAt( 1, new Vector3() )
];
assert.deepEqual( points, expectedPoints, 'Correct points' );
} );
QUnit.test( 'getTangent/getTangentAt', ( assert ) => {
var curve = _curve;
var expectedTangents = [
new Vector3( 0.8755715084258769, 0.4377711603816079, - 0.2042815331129452 ),
new Vector3( 0.9340289249885844, 0.3502608468707904, - 0.07005216937416067 ),
new Vector3( 0.9284766908853163, 0, 0.37139067635396156 ),
new Vector3( - 3.669031233375946e-13, - 0.6196442885791218, 0.7848827655333463 ),
new Vector3( - 0.4263618889888853, - 0.6396068005601663, 0.6396238584473043 )
];
var tangents = [
curve.getTangent( 0, new Vector3() ),
curve.getTangent( 0.25, new Vector3() ),
curve.getTangent( 0.5, new Vector3() ),
curve.getTangent( 0.75, new Vector3() ),
curve.getTangent( 1, new Vector3() )
];
expectedTangents.forEach( function ( exp, i ) {
var tangent = tangents[ i ];
assert.numEqual( tangent.x, exp.x, 'getTangent #' + i + ': x correct' );
assert.numEqual( tangent.y, exp.y, 'getTangent #' + i + ': y correct' );
} );
//
expectedTangents = [
new Vector3( 0.8755715084258769, 0.4377711603816079, - 0.2042815331129452 ),
new Vector3( 0.9060725703490549, 0.3984742932857448, - 0.14230507668907377 ),
new Vector3( 0.9621604167456882, 0.2688562845452628, 0.044312872940942424 ),
new Vector3( 0.016586454041780826, - 0.6163270940470614, 0.7873155674098058 ),
new Vector3( - 0.4263618889888853, - 0.6396068005601663, 0.6396238584473043 )
];
tangents = [
curve.getTangentAt( 0, new Vector3() ),
curve.getTangentAt( 0.25, new Vector3() ),
curve.getTangentAt( 0.5, new Vector3() ),
curve.getTangentAt( 0.75, new Vector3() ),
curve.getTangentAt( 1, new Vector3() )
];
expectedTangents.forEach( function ( exp, i ) {
var tangent = tangents[ i ];
assert.numEqual( tangent.x, exp.x, 'getTangentAt #' + i + ': x correct' );
assert.numEqual( tangent.y, exp.y, 'getTangentAt #' + i + ': y correct' );
} );
} );
QUnit.test( 'getUtoTmapping', ( assert ) => {
var curve = _curve;
var start = curve.getUtoTmapping( 0, 0 );
var end = curve.getUtoTmapping( 0, curve.getLength() );
var somewhere = curve.getUtoTmapping( 0.5, 1 );
var expectedSomewhere = 0.014760890927167196;
assert.strictEqual( start, 0, 'getUtoTmapping( 0, 0 ) is the starting point' );
assert.strictEqual( end, 1, 'getUtoTmapping( 0, length ) is the ending point' );
assert.numEqual( somewhere, expectedSomewhere, 'getUtoTmapping( 0.5, 1 ) is correct' );
} );
QUnit.test( 'getSpacedPoints', ( assert ) => {
var curve = _curve;
var expectedPoints = [
new Vector3( - 10, 0, 2 ),
new Vector3( - 3.712652983516992, 3.015179001762753, 0.6957120710270492 ),
new Vector3( 2.7830973773262975, 5.730399338061483, - 0.1452668772806931 ),
new Vector3( 9.575825284074465, 7.48754187603603, 0.3461104039841496 ),
new Vector3( 12.345199937734154, 4.575759904730531, 5.142117429101656 ),
new Vector3( 10, 0, 10 )
];
var points = curve.getSpacedPoints();
assert.strictEqual( points.length, expectedPoints.length, 'Correct number of points' );
assert.deepEqual( points, expectedPoints, 'Correct points calculated' );
} );
QUnit.test( 'computeFrenetFrames', ( assert ) => {
var curve = _curve;
var expected = {
binormals: [
new Vector3( - 0.447201668889759, 0.8944331542056199, 0 ),
new Vector3( - 0.2684231751110917, 0.9631753839815436, - 0.01556209353802903 ),
new Vector3( 0.3459273556592433, 0.53807011680075, 0.7686447905324219 )
],
normals: [
new Vector3( - 0.18271617600817133, - 0.09135504253146765, - 0.9789121795283909 ),
new Vector3( 0.046865035058597876, - 0.003078628350883253, - 0.9988964863970807 ),
new Vector3( 0.8357929194629689, - 0.5489842348221077, 0.008155102228190641 )
],
tangents: [
new Vector3( 0.8755715084258767, 0.4377711603816078, - 0.20428153311294514 ),
new Vector3( 0.9621604167456884, 0.26885628454526284, 0.04431287294094243 ),
new Vector3( - 0.4263618889888853, - 0.6396068005601663, 0.6396238584473043 )
]
};
var frames = curve.computeFrenetFrames( 2, false );
Object.keys( expected ).forEach( function ( group, i ) {
expected[ group ].forEach( function ( vec, j ) {
assert.numEqual( frames[ group ][ j ].x, vec.x, 'Frenet frames [' + i + ', ' + j + '].x correct' );
assert.numEqual( frames[ group ][ j ].y, vec.y, 'Frenet frames [' + i + ', ' + j + '].y correct' );
assert.numEqual( frames[ group ][ j ].z, vec.z, 'Frenet frames [' + i + ', ' + j + '].z correct' );
} );
} );
} );
} );
} );
} );
|