BufferGeometryUtils.js 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724
  1. /**
  2. * @author mrdoob / http://mrdoob.com/
  3. */
  4. THREE.BufferGeometryUtils = {
  5. computeTangents: function ( geometry ) {
  6. var index = geometry.index;
  7. var attributes = geometry.attributes;
  8. // based on http://www.terathon.com/code/tangent.html
  9. // (per vertex tangents)
  10. if ( index === null ||
  11. attributes.position === undefined ||
  12. attributes.normal === undefined ||
  13. attributes.uv === undefined ) {
  14. console.warn( 'THREE.BufferGeometry: Missing required attributes (index, position, normal or uv) in BufferGeometry.computeTangents()' );
  15. return;
  16. }
  17. var indices = index.array;
  18. var positions = attributes.position.array;
  19. var normals = attributes.normal.array;
  20. var uvs = attributes.uv.array;
  21. var nVertices = positions.length / 3;
  22. if ( attributes.tangent === undefined ) {
  23. geometry.setAttribute( 'tangent', new THREE.BufferAttribute( new Float32Array( 4 * nVertices ), 4 ) );
  24. }
  25. var tangents = attributes.tangent.array;
  26. var tan1 = [], tan2 = [];
  27. for ( var i = 0; i < nVertices; i ++ ) {
  28. tan1[ i ] = new THREE.Vector3();
  29. tan2[ i ] = new THREE.Vector3();
  30. }
  31. var vA = new THREE.Vector3(),
  32. vB = new THREE.Vector3(),
  33. vC = new THREE.Vector3(),
  34. uvA = new THREE.Vector2(),
  35. uvB = new THREE.Vector2(),
  36. uvC = new THREE.Vector2(),
  37. sdir = new THREE.Vector3(),
  38. tdir = new THREE.Vector3();
  39. function handleTriangle( a, b, c ) {
  40. vA.fromArray( positions, a * 3 );
  41. vB.fromArray( positions, b * 3 );
  42. vC.fromArray( positions, c * 3 );
  43. uvA.fromArray( uvs, a * 2 );
  44. uvB.fromArray( uvs, b * 2 );
  45. uvC.fromArray( uvs, c * 2 );
  46. vB.sub( vA );
  47. vC.sub( vA );
  48. uvB.sub( uvA );
  49. uvC.sub( uvA );
  50. var r = 1.0 / ( uvB.x * uvC.y - uvC.x * uvB.y );
  51. // silently ignore degenerate uv triangles having coincident or colinear vertices
  52. if ( ! isFinite( r ) ) return;
  53. sdir.copy( vB ).multiplyScalar( uvC.y ).addScaledVector( vC, - uvB.y ).multiplyScalar( r );
  54. tdir.copy( vC ).multiplyScalar( uvB.x ).addScaledVector( vB, - uvC.x ).multiplyScalar( r );
  55. tan1[ a ].add( sdir );
  56. tan1[ b ].add( sdir );
  57. tan1[ c ].add( sdir );
  58. tan2[ a ].add( tdir );
  59. tan2[ b ].add( tdir );
  60. tan2[ c ].add( tdir );
  61. }
  62. var groups = geometry.groups;
  63. if ( groups.length === 0 ) {
  64. groups = [ {
  65. start: 0,
  66. count: indices.length
  67. } ];
  68. }
  69. for ( var i = 0, il = groups.length; i < il; ++ i ) {
  70. var group = groups[ i ];
  71. var start = group.start;
  72. var count = group.count;
  73. for ( var j = start, jl = start + count; j < jl; j += 3 ) {
  74. handleTriangle(
  75. indices[ j + 0 ],
  76. indices[ j + 1 ],
  77. indices[ j + 2 ]
  78. );
  79. }
  80. }
  81. var tmp = new THREE.Vector3(), tmp2 = new THREE.Vector3();
  82. var n = new THREE.Vector3(), n2 = new THREE.Vector3();
  83. var w, t, test;
  84. function handleVertex( v ) {
  85. n.fromArray( normals, v * 3 );
  86. n2.copy( n );
  87. t = tan1[ v ];
  88. // Gram-Schmidt orthogonalize
  89. tmp.copy( t );
  90. tmp.sub( n.multiplyScalar( n.dot( t ) ) ).normalize();
  91. // Calculate handedness
  92. tmp2.crossVectors( n2, t );
  93. test = tmp2.dot( tan2[ v ] );
  94. w = ( test < 0.0 ) ? - 1.0 : 1.0;
  95. tangents[ v * 4 ] = tmp.x;
  96. tangents[ v * 4 + 1 ] = tmp.y;
  97. tangents[ v * 4 + 2 ] = tmp.z;
  98. tangents[ v * 4 + 3 ] = w;
  99. }
  100. for ( var i = 0, il = groups.length; i < il; ++ i ) {
  101. var group = groups[ i ];
  102. var start = group.start;
  103. var count = group.count;
  104. for ( var j = start, jl = start + count; j < jl; j += 3 ) {
  105. handleVertex( indices[ j + 0 ] );
  106. handleVertex( indices[ j + 1 ] );
  107. handleVertex( indices[ j + 2 ] );
  108. }
  109. }
  110. },
  111. /**
  112. * @param {Array<THREE.BufferGeometry>} geometries
  113. * @param {Boolean} useGroups
  114. * @return {THREE.BufferGeometry}
  115. */
  116. mergeBufferGeometries: function ( geometries, useGroups ) {
  117. var isIndexed = geometries[ 0 ].index !== null;
  118. var attributesUsed = new Set( Object.keys( geometries[ 0 ].attributes ) );
  119. var morphAttributesUsed = new Set( Object.keys( geometries[ 0 ].morphAttributes ) );
  120. var attributes = {};
  121. var morphAttributes = {};
  122. var morphTargetsRelative = geometries[ 0 ].morphTargetsRelative;
  123. var mergedGeometry = new THREE.BufferGeometry();
  124. var offset = 0;
  125. for ( var i = 0; i < geometries.length; ++ i ) {
  126. var geometry = geometries[ i ];
  127. // ensure that all geometries are indexed, or none
  128. if ( isIndexed !== ( geometry.index !== null ) ) return null;
  129. // gather attributes, exit early if they're different
  130. for ( var name in geometry.attributes ) {
  131. if ( ! attributesUsed.has( name ) ) return null;
  132. if ( attributes[ name ] === undefined ) attributes[ name ] = [];
  133. attributes[ name ].push( geometry.attributes[ name ] );
  134. }
  135. // gather morph attributes, exit early if they're different
  136. if ( morphTargetsRelative !== geometry.morphTargetsRelative ) return null;
  137. for ( var name in geometry.morphAttributes ) {
  138. if ( ! morphAttributesUsed.has( name ) ) return null;
  139. if ( morphAttributes[ name ] === undefined ) morphAttributes[ name ] = [];
  140. morphAttributes[ name ].push( geometry.morphAttributes[ name ] );
  141. }
  142. // gather .userData
  143. mergedGeometry.userData.mergedUserData = mergedGeometry.userData.mergedUserData || [];
  144. mergedGeometry.userData.mergedUserData.push( geometry.userData );
  145. if ( useGroups ) {
  146. var count;
  147. if ( isIndexed ) {
  148. count = geometry.index.count;
  149. } else if ( geometry.attributes.position !== undefined ) {
  150. count = geometry.attributes.position.count;
  151. } else {
  152. return null;
  153. }
  154. mergedGeometry.addGroup( offset, count, i );
  155. offset += count;
  156. }
  157. }
  158. // merge indices
  159. if ( isIndexed ) {
  160. var indexOffset = 0;
  161. var mergedIndex = [];
  162. for ( var i = 0; i < geometries.length; ++ i ) {
  163. var index = geometries[ i ].index;
  164. for ( var j = 0; j < index.count; ++ j ) {
  165. mergedIndex.push( index.getX( j ) + indexOffset );
  166. }
  167. indexOffset += geometries[ i ].attributes.position.count;
  168. }
  169. mergedGeometry.setIndex( mergedIndex );
  170. }
  171. // merge attributes
  172. for ( var name in attributes ) {
  173. var mergedAttribute = this.mergeBufferAttributes( attributes[ name ] );
  174. if ( ! mergedAttribute ) return null;
  175. mergedGeometry.setAttribute( name, mergedAttribute );
  176. }
  177. // merge morph attributes
  178. for ( var name in morphAttributes ) {
  179. var numMorphTargets = morphAttributes[ name ][ 0 ].length;
  180. if ( numMorphTargets === 0 ) break;
  181. mergedGeometry.morphAttributes = mergedGeometry.morphAttributes || {};
  182. mergedGeometry.morphAttributes[ name ] = [];
  183. for ( var i = 0; i < numMorphTargets; ++ i ) {
  184. var morphAttributesToMerge = [];
  185. for ( var j = 0; j < morphAttributes[ name ].length; ++ j ) {
  186. morphAttributesToMerge.push( morphAttributes[ name ][ j ][ i ] );
  187. }
  188. var mergedMorphAttribute = this.mergeBufferAttributes( morphAttributesToMerge );
  189. if ( ! mergedMorphAttribute ) return null;
  190. mergedGeometry.morphAttributes[ name ].push( mergedMorphAttribute );
  191. }
  192. }
  193. return mergedGeometry;
  194. },
  195. /**
  196. * @param {Array<THREE.BufferAttribute>} attributes
  197. * @return {THREE.BufferAttribute}
  198. */
  199. mergeBufferAttributes: function ( attributes ) {
  200. var TypedArray;
  201. var itemSize;
  202. var normalized;
  203. var arrayLength = 0;
  204. for ( var i = 0; i < attributes.length; ++ i ) {
  205. var attribute = attributes[ i ];
  206. if ( attribute.isInterleavedBufferAttribute ) return null;
  207. if ( TypedArray === undefined ) TypedArray = attribute.array.constructor;
  208. if ( TypedArray !== attribute.array.constructor ) return null;
  209. if ( itemSize === undefined ) itemSize = attribute.itemSize;
  210. if ( itemSize !== attribute.itemSize ) return null;
  211. if ( normalized === undefined ) normalized = attribute.normalized;
  212. if ( normalized !== attribute.normalized ) return null;
  213. arrayLength += attribute.array.length;
  214. }
  215. var array = new TypedArray( arrayLength );
  216. var offset = 0;
  217. for ( var i = 0; i < attributes.length; ++ i ) {
  218. array.set( attributes[ i ].array, offset );
  219. offset += attributes[ i ].array.length;
  220. }
  221. return new THREE.BufferAttribute( array, itemSize, normalized );
  222. },
  223. /**
  224. * @param {Array<THREE.BufferAttribute>} attributes
  225. * @return {Array<THREE.InterleavedBufferAttribute>}
  226. */
  227. interleaveAttributes: function ( attributes ) {
  228. // Interleaves the provided attributes into an InterleavedBuffer and returns
  229. // a set of InterleavedBufferAttributes for each attribute
  230. var TypedArray;
  231. var arrayLength = 0;
  232. var stride = 0;
  233. // calculate the the length and type of the interleavedBuffer
  234. for ( var i = 0, l = attributes.length; i < l; ++ i ) {
  235. var attribute = attributes[ i ];
  236. if ( TypedArray === undefined ) TypedArray = attribute.array.constructor;
  237. if ( TypedArray !== attribute.array.constructor ) {
  238. console.warn( 'AttributeBuffers of different types cannot be interleaved' );
  239. return null;
  240. }
  241. arrayLength += attribute.array.length;
  242. stride += attribute.itemSize;
  243. }
  244. // Create the set of buffer attributes
  245. var interleavedBuffer = new THREE.InterleavedBuffer( new TypedArray( arrayLength ), stride );
  246. var offset = 0;
  247. var res = [];
  248. var getters = [ 'getX', 'getY', 'getZ', 'getW' ];
  249. var setters = [ 'setX', 'setY', 'setZ', 'setW' ];
  250. for ( var j = 0, l = attributes.length; j < l; j ++ ) {
  251. var attribute = attributes[ j ];
  252. var itemSize = attribute.itemSize;
  253. var count = attribute.count;
  254. var iba = new THREE.InterleavedBufferAttribute( interleavedBuffer, itemSize, offset, attribute.normalized );
  255. res.push( iba );
  256. offset += itemSize;
  257. // Move the data for each attribute into the new interleavedBuffer
  258. // at the appropriate offset
  259. for ( var c = 0; c < count; c ++ ) {
  260. for ( var k = 0; k < itemSize; k ++ ) {
  261. iba[ setters[ k ] ]( c, attribute[ getters[ k ] ]( c ) );
  262. }
  263. }
  264. }
  265. return res;
  266. },
  267. /**
  268. * @param {Array<THREE.BufferGeometry>} geometry
  269. * @return {number}
  270. */
  271. estimateBytesUsed: function ( geometry ) {
  272. // Return the estimated memory used by this geometry in bytes
  273. // Calculate using itemSize, count, and BYTES_PER_ELEMENT to account
  274. // for InterleavedBufferAttributes.
  275. var mem = 0;
  276. for ( var name in geometry.attributes ) {
  277. var attr = geometry.getAttribute( name );
  278. mem += attr.count * attr.itemSize * attr.array.BYTES_PER_ELEMENT;
  279. }
  280. var indices = geometry.getIndex();
  281. mem += indices ? indices.count * indices.itemSize * indices.array.BYTES_PER_ELEMENT : 0;
  282. return mem;
  283. },
  284. /**
  285. * @param {THREE.BufferGeometry} geometry
  286. * @param {number} tolerance
  287. * @return {THREE.BufferGeometry>}
  288. */
  289. mergeVertices: function ( geometry, tolerance = 1e-4 ) {
  290. tolerance = Math.max( tolerance, Number.EPSILON );
  291. // Generate an index buffer if the geometry doesn't have one, or optimize it
  292. // if it's already available.
  293. var hashToIndex = {};
  294. var indices = geometry.getIndex();
  295. var positions = geometry.getAttribute( 'position' );
  296. var vertexCount = indices ? indices.count : positions.count;
  297. // next value for triangle indices
  298. var nextIndex = 0;
  299. // attributes and new attribute arrays
  300. var attributeNames = Object.keys( geometry.attributes );
  301. var attrArrays = {};
  302. var morphAttrsArrays = {};
  303. var newIndices = [];
  304. var getters = [ 'getX', 'getY', 'getZ', 'getW' ];
  305. // initialize the arrays
  306. for ( var i = 0, l = attributeNames.length; i < l; i ++ ) {
  307. var name = attributeNames[ i ];
  308. attrArrays[ name ] = [];
  309. var morphAttr = geometry.morphAttributes[ name ];
  310. if ( morphAttr ) {
  311. morphAttrsArrays[ name ] = new Array( morphAttr.length ).fill().map( () => [] );
  312. }
  313. }
  314. // convert the error tolerance to an amount of decimal places to truncate to
  315. var decimalShift = Math.log10( 1 / tolerance );
  316. var shiftMultiplier = Math.pow( 10, decimalShift );
  317. for ( var i = 0; i < vertexCount; i ++ ) {
  318. var index = indices ? indices.getX( i ) : i;
  319. // Generate a hash for the vertex attributes at the current index 'i'
  320. var hash = '';
  321. for ( var j = 0, l = attributeNames.length; j < l; j ++ ) {
  322. var name = attributeNames[ j ];
  323. var attribute = geometry.getAttribute( name );
  324. var itemSize = attribute.itemSize;
  325. for ( var k = 0; k < itemSize; k ++ ) {
  326. // double tilde truncates the decimal value
  327. hash += `${ ~ ~ ( attribute[ getters[ k ] ]( index ) * shiftMultiplier ) },`;
  328. }
  329. }
  330. // Add another reference to the vertex if it's already
  331. // used by another index
  332. if ( hash in hashToIndex ) {
  333. newIndices.push( hashToIndex[ hash ] );
  334. } else {
  335. // copy data to the new index in the attribute arrays
  336. for ( var j = 0, l = attributeNames.length; j < l; j ++ ) {
  337. var name = attributeNames[ j ];
  338. var attribute = geometry.getAttribute( name );
  339. var morphAttr = geometry.morphAttributes[ name ];
  340. var itemSize = attribute.itemSize;
  341. var newarray = attrArrays[ name ];
  342. var newMorphArrays = morphAttrsArrays[ name ];
  343. for ( var k = 0; k < itemSize; k ++ ) {
  344. var getterFunc = getters[ k ];
  345. newarray.push( attribute[ getterFunc ]( index ) );
  346. if ( morphAttr ) {
  347. for ( var m = 0, ml = morphAttr.length; m < ml; m ++ ) {
  348. newMorphArrays[ m ].push( morphAttr[ m ][ getterFunc ]( index ) );
  349. }
  350. }
  351. }
  352. }
  353. hashToIndex[ hash ] = nextIndex;
  354. newIndices.push( nextIndex );
  355. nextIndex ++;
  356. }
  357. }
  358. // Generate typed arrays from new attribute arrays and update
  359. // the attributeBuffers
  360. const result = geometry.clone();
  361. for ( var i = 0, l = attributeNames.length; i < l; i ++ ) {
  362. var name = attributeNames[ i ];
  363. var oldAttribute = geometry.getAttribute( name );
  364. var buffer = new oldAttribute.array.constructor( attrArrays[ name ] );
  365. var attribute = new THREE.BufferAttribute( buffer, oldAttribute.itemSize, oldAttribute.normalized );
  366. result.setAttribute( name, attribute );
  367. // Update the attribute arrays
  368. if ( name in morphAttrsArrays ) {
  369. for ( var j = 0; j < morphAttrsArrays[ name ].length; j ++ ) {
  370. var oldMorphAttribute = geometry.morphAttributes[ name ][ j ];
  371. var buffer = new oldMorphAttribute.array.constructor( morphAttrsArrays[ name ][ j ] );
  372. var morphAttribute = new THREE.BufferAttribute( buffer, oldMorphAttribute.itemSize, oldMorphAttribute.normalized );
  373. result.morphAttributes[ name ][ j ] = morphAttribute;
  374. }
  375. }
  376. }
  377. // indices
  378. result.setIndex( newIndices );
  379. return result;
  380. },
  381. /**
  382. * @param {THREE.BufferGeometry} geometry
  383. * @param {number} drawMode
  384. * @return {THREE.BufferGeometry>}
  385. */
  386. toTrianglesDrawMode: function ( geometry, drawMode ) {
  387. if ( drawMode === THREE.TrianglesDrawMode ) {
  388. console.warn( 'THREE.BufferGeometryUtils.toTrianglesDrawMode(): Geometry already defined as triangles.' );
  389. return geometry;
  390. }
  391. if ( drawMode === THREE.TriangleFanDrawMode || drawMode === THREE.TriangleStripDrawMode ) {
  392. var index = geometry.getIndex();
  393. // generate index if not present
  394. if ( index === null ) {
  395. var indices = [];
  396. var position = geometry.getAttribute( 'position' );
  397. if ( position !== undefined ) {
  398. for ( var i = 0; i < position.count; i ++ ) {
  399. indices.push( i );
  400. }
  401. geometry.setIndex( indices );
  402. index = geometry.getIndex();
  403. } else {
  404. console.error( 'THREE.BufferGeometryUtils.toTrianglesDrawMode(): Undefined position attribute. Processing not possible.' );
  405. return geometry;
  406. }
  407. }
  408. //
  409. var numberOfTriangles = index.count - 2;
  410. var newIndices = [];
  411. if ( drawMode === THREE.TriangleFanDrawMode ) {
  412. // gl.TRIANGLE_FAN
  413. for ( var i = 1; i <= numberOfTriangles; i ++ ) {
  414. newIndices.push( index.getX( 0 ) );
  415. newIndices.push( index.getX( i ) );
  416. newIndices.push( index.getX( i + 1 ) );
  417. }
  418. } else {
  419. // gl.TRIANGLE_STRIP
  420. for ( var i = 0; i < numberOfTriangles; i ++ ) {
  421. if ( i % 2 === 0 ) {
  422. newIndices.push( index.getX( i ) );
  423. newIndices.push( index.getX( i + 1 ) );
  424. newIndices.push( index.getX( i + 2 ) );
  425. } else {
  426. newIndices.push( index.getX( i + 2 ) );
  427. newIndices.push( index.getX( i + 1 ) );
  428. newIndices.push( index.getX( i ) );
  429. }
  430. }
  431. }
  432. if ( ( newIndices.length / 3 ) !== numberOfTriangles ) {
  433. console.error( 'THREE.BufferGeometryUtils.toTrianglesDrawMode(): Unable to generate correct amount of triangles.' );
  434. }
  435. // build final geometry
  436. var newGeometry = geometry.clone();
  437. newGeometry.setIndex( newIndices );
  438. newGeometry.clearGroups();
  439. return newGeometry;
  440. } else {
  441. console.error( 'THREE.BufferGeometryUtils.toTrianglesDrawMode(): Unknown draw mode:', drawMode );
  442. return geometry;
  443. }
  444. }
  445. };