Frustum.js 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196
  1. /**
  2. * @author mrdoob / http://mrdoob.com/
  3. * @author alteredq / http://alteredqualia.com/
  4. * @author bhouston / http://exocortex.com
  5. */
  6. THREE.Frustum = function ( p0, p1, p2, p3, p4, p5 ) {
  7. this.planes = [
  8. ( p0 !== undefined ) ? p0 : new THREE.Plane(),
  9. ( p1 !== undefined ) ? p1 : new THREE.Plane(),
  10. ( p2 !== undefined ) ? p2 : new THREE.Plane(),
  11. ( p3 !== undefined ) ? p3 : new THREE.Plane(),
  12. ( p4 !== undefined ) ? p4 : new THREE.Plane(),
  13. ( p5 !== undefined ) ? p5 : new THREE.Plane()
  14. ];
  15. };
  16. THREE.Frustum.prototype = {
  17. constructor: THREE.Frustum,
  18. set: function ( p0, p1, p2, p3, p4, p5 ) {
  19. var planes = this.planes;
  20. planes[0].copy( p0 );
  21. planes[1].copy( p1 );
  22. planes[2].copy( p2 );
  23. planes[3].copy( p3 );
  24. planes[4].copy( p4 );
  25. planes[5].copy( p5 );
  26. return this;
  27. },
  28. copy: function ( frustum ) {
  29. var planes = this.planes;
  30. for( var i = 0; i < 6; i ++ ) {
  31. planes[i].copy( frustum.planes[i] );
  32. }
  33. return this;
  34. },
  35. setFromMatrix: function ( m ) {
  36. var planes = this.planes;
  37. var me = m.elements;
  38. var me0 = me[0], me1 = me[1], me2 = me[2], me3 = me[3];
  39. var me4 = me[4], me5 = me[5], me6 = me[6], me7 = me[7];
  40. var me8 = me[8], me9 = me[9], me10 = me[10], me11 = me[11];
  41. var me12 = me[12], me13 = me[13], me14 = me[14], me15 = me[15];
  42. planes[ 0 ].setComponents( me3 - me0, me7 - me4, me11 - me8, me15 - me12 ).normalize();
  43. planes[ 1 ].setComponents( me3 + me0, me7 + me4, me11 + me8, me15 + me12 ).normalize();
  44. planes[ 2 ].setComponents( me3 + me1, me7 + me5, me11 + me9, me15 + me13 ).normalize();
  45. planes[ 3 ].setComponents( me3 - me1, me7 - me5, me11 - me9, me15 - me13 ).normalize();
  46. planes[ 4 ].setComponents( me3 - me2, me7 - me6, me11 - me10, me15 - me14 ).normalize();
  47. planes[ 5 ].setComponents( me3 + me2, me7 + me6, me11 + me10, me15 + me14 ).normalize();
  48. return this;
  49. },
  50. intersectsObject: function () {
  51. var center = new THREE.Vector3();
  52. return function ( object ) {
  53. // this method is expanded inlined for performance reasons.
  54. var geometry = object.geometry;
  55. var matrix = object.matrixWorld;
  56. if ( geometry.boundingSphere === null ) geometry.computeBoundingSphere();
  57. var negRadius = - geometry.boundingSphere.radius * matrix.getMaxScaleOnAxis();
  58. center.getPositionFromMatrix( matrix );
  59. var planes = this.planes;
  60. for ( var i = 0; i < 6; i ++ ) {
  61. var distance = planes[ i ].distanceToPoint( center );
  62. if ( distance < negRadius ) {
  63. return false;
  64. }
  65. }
  66. return true;
  67. };
  68. }(),
  69. intersectsSphere: function ( sphere ) {
  70. var planes = this.planes;
  71. var center = sphere.center;
  72. var negRadius = -sphere.radius;
  73. for ( var i = 0; i < 6; i ++ ) {
  74. var distance = planes[ i ].distanceToPoint( center );
  75. if ( distance < negRadius ) {
  76. return false;
  77. }
  78. }
  79. return true;
  80. },
  81. intersectsBox : function() {
  82. var p1 = new THREE.Vector3(),
  83. p2 = new THREE.Vector3();
  84. return function( box ) {
  85. var planes = this.planes;
  86. for ( var i = 0; i < 6 ; i ++ ) {
  87. var plane = planes[i];
  88. p1.x = plane.normal.x > 0 ? box.min.x : box.max.x;
  89. p2.x = plane.normal.x > 0 ? box.max.x : box.min.x;
  90. p1.y = plane.normal.y > 0 ? box.min.y : box.max.y;
  91. p2.y = plane.normal.y > 0 ? box.max.y : box.min.y;
  92. p1.z = plane.normal.z > 0 ? box.min.z : box.max.z;
  93. p2.z = plane.normal.z > 0 ? box.max.z : box.min.z;
  94. var d1 = plane.distanceToPoint( p1 );
  95. var d2 = plane.distanceToPoint( p2 );
  96. // if both outside plane, no intersection
  97. if ( d1 < 0 && d2 < 0 ) {
  98. return false;
  99. }
  100. }
  101. return true;
  102. };
  103. }(),
  104. containsPoint: function ( point ) {
  105. var planes = this.planes;
  106. for ( var i = 0; i < 6; i ++ ) {
  107. if ( planes[ i ].distanceToPoint( point ) < 0 ) {
  108. return false;
  109. }
  110. }
  111. return true;
  112. },
  113. clone: function () {
  114. return new THREE.Frustum().copy( this );
  115. }
  116. };