TessellateModifier.js 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237
  1. console.warn( "THREE.TessellateModifier: As part of the transition to ES6 Modules, the files in 'examples/js' were deprecated in May 2020 (r117) and will be deleted in December 2020 (r124). You can find more information about developing using ES6 Modules in https://threejs.org/docs/index.html#manual/en/introduction/Import-via-modules." );
  2. /**
  3. * Break faces with edges longer than maxEdgeLength
  4. * - not recursive
  5. *
  6. * @author alteredq / http://alteredqualia.com/
  7. */
  8. THREE.TessellateModifier = function ( maxEdgeLength ) {
  9. this.maxEdgeLength = maxEdgeLength;
  10. };
  11. THREE.TessellateModifier.prototype.modify = function ( geometry ) {
  12. var edge;
  13. var faces = [];
  14. var faceVertexUvs = [];
  15. var maxEdgeLengthSquared = this.maxEdgeLength * this.maxEdgeLength;
  16. for ( var i = 0, il = geometry.faceVertexUvs.length; i < il; i ++ ) {
  17. faceVertexUvs[ i ] = [];
  18. }
  19. for ( var i = 0, il = geometry.faces.length; i < il; i ++ ) {
  20. var face = geometry.faces[ i ];
  21. if ( face instanceof THREE.Face3 ) {
  22. var a = face.a;
  23. var b = face.b;
  24. var c = face.c;
  25. var va = geometry.vertices[ a ];
  26. var vb = geometry.vertices[ b ];
  27. var vc = geometry.vertices[ c ];
  28. var dab = va.distanceToSquared( vb );
  29. var dbc = vb.distanceToSquared( vc );
  30. var dac = va.distanceToSquared( vc );
  31. if ( dab > maxEdgeLengthSquared || dbc > maxEdgeLengthSquared || dac > maxEdgeLengthSquared ) {
  32. var m = geometry.vertices.length;
  33. var triA = face.clone();
  34. var triB = face.clone();
  35. if ( dab >= dbc && dab >= dac ) {
  36. var vm = va.clone();
  37. vm.lerp( vb, 0.5 );
  38. triA.a = a;
  39. triA.b = m;
  40. triA.c = c;
  41. triB.a = m;
  42. triB.b = b;
  43. triB.c = c;
  44. if ( face.vertexNormals.length === 3 ) {
  45. var vnm = face.vertexNormals[ 0 ].clone();
  46. vnm.lerp( face.vertexNormals[ 1 ], 0.5 );
  47. triA.vertexNormals[ 1 ].copy( vnm );
  48. triB.vertexNormals[ 0 ].copy( vnm );
  49. }
  50. if ( face.vertexColors.length === 3 ) {
  51. var vcm = face.vertexColors[ 0 ].clone();
  52. vcm.lerp( face.vertexColors[ 1 ], 0.5 );
  53. triA.vertexColors[ 1 ].copy( vcm );
  54. triB.vertexColors[ 0 ].copy( vcm );
  55. }
  56. edge = 0;
  57. } else if ( dbc >= dab && dbc >= dac ) {
  58. var vm = vb.clone();
  59. vm.lerp( vc, 0.5 );
  60. triA.a = a;
  61. triA.b = b;
  62. triA.c = m;
  63. triB.a = m;
  64. triB.b = c;
  65. triB.c = a;
  66. if ( face.vertexNormals.length === 3 ) {
  67. var vnm = face.vertexNormals[ 1 ].clone();
  68. vnm.lerp( face.vertexNormals[ 2 ], 0.5 );
  69. triA.vertexNormals[ 2 ].copy( vnm );
  70. triB.vertexNormals[ 0 ].copy( vnm );
  71. triB.vertexNormals[ 1 ].copy( face.vertexNormals[ 2 ] );
  72. triB.vertexNormals[ 2 ].copy( face.vertexNormals[ 0 ] );
  73. }
  74. if ( face.vertexColors.length === 3 ) {
  75. var vcm = face.vertexColors[ 1 ].clone();
  76. vcm.lerp( face.vertexColors[ 2 ], 0.5 );
  77. triA.vertexColors[ 2 ].copy( vcm );
  78. triB.vertexColors[ 0 ].copy( vcm );
  79. triB.vertexColors[ 1 ].copy( face.vertexColors[ 2 ] );
  80. triB.vertexColors[ 2 ].copy( face.vertexColors[ 0 ] );
  81. }
  82. edge = 1;
  83. } else {
  84. var vm = va.clone();
  85. vm.lerp( vc, 0.5 );
  86. triA.a = a;
  87. triA.b = b;
  88. triA.c = m;
  89. triB.a = m;
  90. triB.b = b;
  91. triB.c = c;
  92. if ( face.vertexNormals.length === 3 ) {
  93. var vnm = face.vertexNormals[ 0 ].clone();
  94. vnm.lerp( face.vertexNormals[ 2 ], 0.5 );
  95. triA.vertexNormals[ 2 ].copy( vnm );
  96. triB.vertexNormals[ 0 ].copy( vnm );
  97. }
  98. if ( face.vertexColors.length === 3 ) {
  99. var vcm = face.vertexColors[ 0 ].clone();
  100. vcm.lerp( face.vertexColors[ 2 ], 0.5 );
  101. triA.vertexColors[ 2 ].copy( vcm );
  102. triB.vertexColors[ 0 ].copy( vcm );
  103. }
  104. edge = 2;
  105. }
  106. faces.push( triA, triB );
  107. geometry.vertices.push( vm );
  108. for ( var j = 0, jl = geometry.faceVertexUvs.length; j < jl; j ++ ) {
  109. if ( geometry.faceVertexUvs[ j ].length ) {
  110. var uvs = geometry.faceVertexUvs[ j ][ i ];
  111. var uvA = uvs[ 0 ];
  112. var uvB = uvs[ 1 ];
  113. var uvC = uvs[ 2 ];
  114. // AB
  115. if ( edge === 0 ) {
  116. var uvM = uvA.clone();
  117. uvM.lerp( uvB, 0.5 );
  118. var uvsTriA = [ uvA.clone(), uvM.clone(), uvC.clone() ];
  119. var uvsTriB = [ uvM.clone(), uvB.clone(), uvC.clone() ];
  120. // BC
  121. } else if ( edge === 1 ) {
  122. var uvM = uvB.clone();
  123. uvM.lerp( uvC, 0.5 );
  124. var uvsTriA = [ uvA.clone(), uvB.clone(), uvM.clone() ];
  125. var uvsTriB = [ uvM.clone(), uvC.clone(), uvA.clone() ];
  126. // AC
  127. } else {
  128. var uvM = uvA.clone();
  129. uvM.lerp( uvC, 0.5 );
  130. var uvsTriA = [ uvA.clone(), uvB.clone(), uvM.clone() ];
  131. var uvsTriB = [ uvM.clone(), uvB.clone(), uvC.clone() ];
  132. }
  133. faceVertexUvs[ j ].push( uvsTriA, uvsTriB );
  134. }
  135. }
  136. } else {
  137. faces.push( face );
  138. for ( var j = 0, jl = geometry.faceVertexUvs.length; j < jl; j ++ ) {
  139. faceVertexUvs[ j ].push( geometry.faceVertexUvs[ j ][ i ] );
  140. }
  141. }
  142. }
  143. }
  144. geometry.faces = faces;
  145. geometry.faceVertexUvs = faceVertexUvs;
  146. };