TessellateModifier.js 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234
  1. /**
  2. * Break faces with edges longer than maxEdgeLength
  3. * - not recursive
  4. */
  5. THREE.TessellateModifier = function ( maxEdgeLength ) {
  6. this.maxEdgeLength = maxEdgeLength;
  7. };
  8. THREE.TessellateModifier.prototype.modify = function ( geometry ) {
  9. var edge;
  10. var faces = [];
  11. var faceVertexUvs = [];
  12. var maxEdgeLengthSquared = this.maxEdgeLength * this.maxEdgeLength;
  13. for ( var i = 0, il = geometry.faceVertexUvs.length; i < il; i ++ ) {
  14. faceVertexUvs[ i ] = [];
  15. }
  16. for ( var i = 0, il = geometry.faces.length; i < il; i ++ ) {
  17. var face = geometry.faces[ i ];
  18. if ( face instanceof THREE.Face3 ) {
  19. var a = face.a;
  20. var b = face.b;
  21. var c = face.c;
  22. var va = geometry.vertices[ a ];
  23. var vb = geometry.vertices[ b ];
  24. var vc = geometry.vertices[ c ];
  25. var dab = va.distanceToSquared( vb );
  26. var dbc = vb.distanceToSquared( vc );
  27. var dac = va.distanceToSquared( vc );
  28. if ( dab > maxEdgeLengthSquared || dbc > maxEdgeLengthSquared || dac > maxEdgeLengthSquared ) {
  29. var m = geometry.vertices.length;
  30. var triA = face.clone();
  31. var triB = face.clone();
  32. if ( dab >= dbc && dab >= dac ) {
  33. var vm = va.clone();
  34. vm.lerp( vb, 0.5 );
  35. triA.a = a;
  36. triA.b = m;
  37. triA.c = c;
  38. triB.a = m;
  39. triB.b = b;
  40. triB.c = c;
  41. if ( face.vertexNormals.length === 3 ) {
  42. var vnm = face.vertexNormals[ 0 ].clone();
  43. vnm.lerp( face.vertexNormals[ 1 ], 0.5 );
  44. triA.vertexNormals[ 1 ].copy( vnm );
  45. triB.vertexNormals[ 0 ].copy( vnm );
  46. }
  47. if ( face.vertexColors.length === 3 ) {
  48. var vcm = face.vertexColors[ 0 ].clone();
  49. vcm.lerp( face.vertexColors[ 1 ], 0.5 );
  50. triA.vertexColors[ 1 ].copy( vcm );
  51. triB.vertexColors[ 0 ].copy( vcm );
  52. }
  53. edge = 0;
  54. } else if ( dbc >= dab && dbc >= dac ) {
  55. var vm = vb.clone();
  56. vm.lerp( vc, 0.5 );
  57. triA.a = a;
  58. triA.b = b;
  59. triA.c = m;
  60. triB.a = m;
  61. triB.b = c;
  62. triB.c = a;
  63. if ( face.vertexNormals.length === 3 ) {
  64. var vnm = face.vertexNormals[ 1 ].clone();
  65. vnm.lerp( face.vertexNormals[ 2 ], 0.5 );
  66. triA.vertexNormals[ 2 ].copy( vnm );
  67. triB.vertexNormals[ 0 ].copy( vnm );
  68. triB.vertexNormals[ 1 ].copy( face.vertexNormals[ 2 ] );
  69. triB.vertexNormals[ 2 ].copy( face.vertexNormals[ 0 ] );
  70. }
  71. if ( face.vertexColors.length === 3 ) {
  72. var vcm = face.vertexColors[ 1 ].clone();
  73. vcm.lerp( face.vertexColors[ 2 ], 0.5 );
  74. triA.vertexColors[ 2 ].copy( vcm );
  75. triB.vertexColors[ 0 ].copy( vcm );
  76. triB.vertexColors[ 1 ].copy( face.vertexColors[ 2 ] );
  77. triB.vertexColors[ 2 ].copy( face.vertexColors[ 0 ] );
  78. }
  79. edge = 1;
  80. } else {
  81. var vm = va.clone();
  82. vm.lerp( vc, 0.5 );
  83. triA.a = a;
  84. triA.b = b;
  85. triA.c = m;
  86. triB.a = m;
  87. triB.b = b;
  88. triB.c = c;
  89. if ( face.vertexNormals.length === 3 ) {
  90. var vnm = face.vertexNormals[ 0 ].clone();
  91. vnm.lerp( face.vertexNormals[ 2 ], 0.5 );
  92. triA.vertexNormals[ 2 ].copy( vnm );
  93. triB.vertexNormals[ 0 ].copy( vnm );
  94. }
  95. if ( face.vertexColors.length === 3 ) {
  96. var vcm = face.vertexColors[ 0 ].clone();
  97. vcm.lerp( face.vertexColors[ 2 ], 0.5 );
  98. triA.vertexColors[ 2 ].copy( vcm );
  99. triB.vertexColors[ 0 ].copy( vcm );
  100. }
  101. edge = 2;
  102. }
  103. faces.push( triA, triB );
  104. geometry.vertices.push( vm );
  105. for ( var j = 0, jl = geometry.faceVertexUvs.length; j < jl; j ++ ) {
  106. if ( geometry.faceVertexUvs[ j ].length ) {
  107. var uvs = geometry.faceVertexUvs[ j ][ i ];
  108. var uvA = uvs[ 0 ];
  109. var uvB = uvs[ 1 ];
  110. var uvC = uvs[ 2 ];
  111. // AB
  112. if ( edge === 0 ) {
  113. var uvM = uvA.clone();
  114. uvM.lerp( uvB, 0.5 );
  115. var uvsTriA = [ uvA.clone(), uvM.clone(), uvC.clone() ];
  116. var uvsTriB = [ uvM.clone(), uvB.clone(), uvC.clone() ];
  117. // BC
  118. } else if ( edge === 1 ) {
  119. var uvM = uvB.clone();
  120. uvM.lerp( uvC, 0.5 );
  121. var uvsTriA = [ uvA.clone(), uvB.clone(), uvM.clone() ];
  122. var uvsTriB = [ uvM.clone(), uvC.clone(), uvA.clone() ];
  123. // AC
  124. } else {
  125. var uvM = uvA.clone();
  126. uvM.lerp( uvC, 0.5 );
  127. var uvsTriA = [ uvA.clone(), uvB.clone(), uvM.clone() ];
  128. var uvsTriB = [ uvM.clone(), uvB.clone(), uvC.clone() ];
  129. }
  130. faceVertexUvs[ j ].push( uvsTriA, uvsTriB );
  131. }
  132. }
  133. } else {
  134. faces.push( face );
  135. for ( var j = 0, jl = geometry.faceVertexUvs.length; j < jl; j ++ ) {
  136. faceVertexUvs[ j ].push( geometry.faceVertexUvs[ j ][ i ] );
  137. }
  138. }
  139. }
  140. }
  141. geometry.faces = faces;
  142. geometry.faceVertexUvs = faceVertexUvs;
  143. };