Frustum.cpp 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210
  1. //
  2. // Copyright (c) 2008-2014 the Urho3D project.
  3. //
  4. // Permission is hereby granted, free of charge, to any person obtaining a copy
  5. // of this software and associated documentation files (the "Software"), to deal
  6. // in the Software without restriction, including without limitation the rights
  7. // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  8. // copies of the Software, and to permit persons to whom the Software is
  9. // furnished to do so, subject to the following conditions:
  10. //
  11. // The above copyright notice and this permission notice shall be included in
  12. // all copies or substantial portions of the Software.
  13. //
  14. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  19. // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  20. // THE SOFTWARE.
  21. //
  22. #include "Precompiled.h"
  23. #include "Frustum.h"
  24. namespace Urho3D
  25. {
  26. inline Vector3 ClipEdgeZ(const Vector3& v0, const Vector3& v1, float clipZ)
  27. {
  28. return Vector3(
  29. v1.x_ + (v0.x_ - v1.x_) * ((clipZ - v1.z_) / (v0.z_ - v1.z_)),
  30. v1.y_ + (v0.y_ - v1.y_) * ((clipZ - v1.z_) / (v0.z_ - v1.z_)),
  31. clipZ
  32. );
  33. }
  34. void ProjectAndMergeEdge(Vector3 v0, Vector3 v1, Rect& rect, const Matrix4& projection)
  35. {
  36. // Check if both vertices behind near plane
  37. if (v0.z_ < M_MIN_NEARCLIP && v1.z_ < M_MIN_NEARCLIP)
  38. return;
  39. // Check if need to clip one of the vertices
  40. if (v1.z_ < M_MIN_NEARCLIP)
  41. v1 = ClipEdgeZ(v1, v0, M_MIN_NEARCLIP);
  42. else if (v0.z_ < M_MIN_NEARCLIP)
  43. v0 = ClipEdgeZ(v0, v1, M_MIN_NEARCLIP);
  44. // Project, perspective divide and merge
  45. Vector3 tV0(projection * v0);
  46. Vector3 tV1(projection * v1);
  47. rect.Merge(Vector2(tV0.x_, tV0.y_));
  48. rect.Merge(Vector2(tV1.x_, tV1.y_));
  49. }
  50. Frustum::Frustum()
  51. {
  52. UpdatePlanes();
  53. }
  54. Frustum::Frustum(const Frustum& frustum)
  55. {
  56. *this = frustum;
  57. }
  58. Frustum& Frustum::operator = (const Frustum& rhs)
  59. {
  60. for (unsigned i = 0; i < NUM_FRUSTUM_PLANES; ++i)
  61. planes_[i] = rhs.planes_[i];
  62. for (unsigned i = 0; i < NUM_FRUSTUM_VERTICES; ++i)
  63. vertices_[i] = rhs.vertices_[i];
  64. return *this;
  65. }
  66. void Frustum::Define(float fov, float aspectRatio, float zoom, float nearZ, float farZ, const Matrix3x4& transform)
  67. {
  68. nearZ = Max(nearZ, 0.0f);
  69. farZ = Max(farZ, nearZ);
  70. float halfViewSize = tanf(fov * M_DEGTORAD_2) / zoom;
  71. Vector3 near, far;
  72. near.z_ = nearZ;
  73. near.y_ = near.z_ * halfViewSize;
  74. near.x_ = near.y_ * aspectRatio;
  75. far.z_ = farZ;
  76. far.y_ = far.z_ * halfViewSize;
  77. far.x_ = far.y_ * aspectRatio;
  78. Define(near, far, transform);
  79. }
  80. void Frustum::Define(const Vector3& near, const Vector3& far, const Matrix3x4& transform)
  81. {
  82. vertices_[0] = transform * near;
  83. vertices_[1] = transform * Vector3(near.x_, -near.y_, near.z_);
  84. vertices_[2] = transform * Vector3(-near.x_, -near.y_, near.z_);
  85. vertices_[3] = transform * Vector3(-near.x_, near.y_, near.z_);
  86. vertices_[4] = transform * far;
  87. vertices_[5] = transform * Vector3(far.x_, -far.y_, far.z_);
  88. vertices_[6] = transform * Vector3(-far.x_, -far.y_, far.z_);
  89. vertices_[7] = transform * Vector3(-far.x_, far.y_, far.z_);
  90. UpdatePlanes();
  91. }
  92. void Frustum::Define(const BoundingBox& box, const Matrix3x4& transform)
  93. {
  94. vertices_[0] = transform * Vector3(box.max_.x_, box.max_.y_, box.min_.z_);
  95. vertices_[1] = transform * Vector3(box.max_.x_, box.min_.y_, box.min_.z_);
  96. vertices_[2] = transform * Vector3(box.min_.x_, box.min_.y_, box.min_.z_);
  97. vertices_[3] = transform * Vector3(box.min_.x_, box.max_.y_, box.min_.z_);
  98. vertices_[4] = transform * Vector3(box.max_.x_, box.max_.y_, box.max_.z_);
  99. vertices_[5] = transform * Vector3(box.max_.x_, box.min_.y_, box.max_.z_);
  100. vertices_[6] = transform * Vector3(box.min_.x_, box.min_.y_, box.max_.z_);
  101. vertices_[7] = transform * Vector3(box.min_.x_, box.max_.y_, box.max_.z_);
  102. UpdatePlanes();
  103. }
  104. void Frustum::DefineOrtho(float orthoSize, float aspectRatio, float zoom, float nearZ, float farZ, const Matrix3x4& transform)
  105. {
  106. nearZ = Max(nearZ, 0.0f);
  107. farZ = Max(farZ, nearZ);
  108. float halfViewSize = orthoSize * 0.5f / zoom;
  109. Vector3 near, far;
  110. near.z_ = nearZ;
  111. far.z_ = farZ;
  112. far.y_ = near.y_ = halfViewSize;
  113. far.x_ = near.x_ = near.y_ * aspectRatio;
  114. Define(near, far, transform);
  115. }
  116. void Frustum::Transform(const Matrix3& transform)
  117. {
  118. for (unsigned i = 0; i < NUM_FRUSTUM_VERTICES; ++i)
  119. vertices_[i] = transform * vertices_[i];
  120. UpdatePlanes();
  121. }
  122. void Frustum::Transform(const Matrix3x4& transform)
  123. {
  124. for (unsigned i = 0; i < NUM_FRUSTUM_VERTICES; ++i)
  125. vertices_[i] = transform * vertices_[i];
  126. UpdatePlanes();
  127. }
  128. Frustum Frustum::Transformed(const Matrix3& transform) const
  129. {
  130. Frustum transformed;
  131. for (unsigned i = 0; i < NUM_FRUSTUM_VERTICES; ++i)
  132. transformed.vertices_[i] = transform * vertices_[i];
  133. transformed.UpdatePlanes();
  134. return transformed;
  135. }
  136. Frustum Frustum::Transformed(const Matrix3x4& transform) const
  137. {
  138. Frustum transformed;
  139. for (unsigned i = 0; i < NUM_FRUSTUM_VERTICES; ++i)
  140. transformed.vertices_[i] = transform * vertices_[i];
  141. transformed.UpdatePlanes();
  142. return transformed;
  143. }
  144. Rect Frustum::Projected(const Matrix4& projection) const
  145. {
  146. Rect rect;
  147. ProjectAndMergeEdge(vertices_[0], vertices_[4], rect, projection);
  148. ProjectAndMergeEdge(vertices_[1], vertices_[5], rect, projection);
  149. ProjectAndMergeEdge(vertices_[2], vertices_[6], rect, projection);
  150. ProjectAndMergeEdge(vertices_[3], vertices_[7], rect, projection);
  151. ProjectAndMergeEdge(vertices_[4], vertices_[5], rect, projection);
  152. ProjectAndMergeEdge(vertices_[5], vertices_[6], rect, projection);
  153. ProjectAndMergeEdge(vertices_[6], vertices_[7], rect, projection);
  154. ProjectAndMergeEdge(vertices_[7], vertices_[4], rect, projection);
  155. return rect;
  156. }
  157. void Frustum::UpdatePlanes()
  158. {
  159. planes_[PLANE_NEAR].Define(vertices_[2], vertices_[1], vertices_[0]);
  160. planes_[PLANE_LEFT].Define(vertices_[3], vertices_[7], vertices_[6]);
  161. planes_[PLANE_RIGHT].Define(vertices_[1], vertices_[5], vertices_[4]);
  162. planes_[PLANE_UP].Define(vertices_[0], vertices_[4], vertices_[7]);
  163. planes_[PLANE_DOWN].Define(vertices_[6], vertices_[5], vertices_[1]);
  164. planes_[PLANE_FAR].Define(vertices_[5], vertices_[6], vertices_[7]);
  165. // Check if we ended up with inverted planes (reflected transform) and flip in that case
  166. if (planes_[PLANE_NEAR].Distance(vertices_[5]) < 0.0f)
  167. {
  168. for (unsigned i = 0; i < NUM_FRUSTUM_PLANES; ++i)
  169. {
  170. planes_[i].normal_ = -planes_[i].normal_;
  171. planes_[i].d_ = -planes_[i].d_;
  172. }
  173. }
  174. }
  175. }