interval.h 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162
  1. // Copyright 2009-2021 Intel Corporation
  2. // SPDX-License-Identifier: Apache-2.0
  3. #pragma once
  4. #include "vec2.h"
  5. #include "vec3.h"
  6. #include "bbox.h"
  7. namespace embree
  8. {
  9. template<typename V>
  10. struct Interval
  11. {
  12. V lower, upper;
  13. __forceinline Interval() {}
  14. __forceinline Interval ( const Interval& other ) { lower = other.lower; upper = other.upper; }
  15. __forceinline Interval& operator=( const Interval& other ) { lower = other.lower; upper = other.upper; return *this; }
  16. __forceinline Interval(const V& a) : lower(a), upper(a) {}
  17. __forceinline Interval(const V& lower, const V& upper) : lower(lower), upper(upper) {}
  18. __forceinline Interval(const BBox<V>& a) : lower(a.lower), upper(a.upper) {}
  19. /*! tests if box is empty */
  20. //__forceinline bool empty() const { return lower > upper; }
  21. /*! computes the size of the interval */
  22. __forceinline V size() const { return upper - lower; }
  23. __forceinline V center() const { return 0.5f*(lower+upper); }
  24. __forceinline const Interval& extend(const Interval& other) { lower = min(lower,other.lower); upper = max(upper,other.upper); return *this; }
  25. __forceinline const Interval& extend(const V & other) { lower = min(lower,other ); upper = max(upper,other ); return *this; }
  26. __forceinline friend Interval operator +( const Interval& a, const Interval& b ) {
  27. return Interval(a.lower+b.lower,a.upper+b.upper);
  28. }
  29. __forceinline friend Interval operator -( const Interval& a, const Interval& b ) {
  30. return Interval(a.lower-b.upper,a.upper-b.lower);
  31. }
  32. __forceinline friend Interval operator -( const Interval& a, const V& b ) {
  33. return Interval(a.lower-b,a.upper-b);
  34. }
  35. __forceinline friend Interval operator *( const Interval& a, const Interval& b )
  36. {
  37. const V ll = a.lower*b.lower;
  38. const V lu = a.lower*b.upper;
  39. const V ul = a.upper*b.lower;
  40. const V uu = a.upper*b.upper;
  41. return Interval(min(ll,lu,ul,uu),max(ll,lu,ul,uu));
  42. }
  43. __forceinline friend Interval merge( const Interval& a, const Interval& b) {
  44. return Interval(min(a.lower,b.lower),max(a.upper,b.upper));
  45. }
  46. __forceinline friend Interval merge( const Interval& a, const Interval& b, const Interval& c) {
  47. return merge(merge(a,b),c);
  48. }
  49. __forceinline friend Interval merge( const Interval& a, const Interval& b, const Interval& c, const Interval& d) {
  50. return merge(merge(a,b),merge(c,d));
  51. }
  52. /*! intersect bounding boxes */
  53. __forceinline friend const Interval intersect( const Interval& a, const Interval& b ) { return Interval(max(a.lower, b.lower), min(a.upper, b.upper)); }
  54. __forceinline friend const Interval intersect( const Interval& a, const Interval& b, const Interval& c ) { return intersect(a,intersect(b,c)); }
  55. __forceinline friend const Interval intersect( const Interval& a, const Interval& b, const Interval& c, const Interval& d ) { return intersect(intersect(a,b),intersect(c,d)); }
  56. friend embree_ostream operator<<(embree_ostream cout, const Interval& a) {
  57. return cout << "[" << a.lower << ", " << a.upper << "]";
  58. }
  59. ////////////////////////////////////////////////////////////////////////////////
  60. /// Constants
  61. ////////////////////////////////////////////////////////////////////////////////
  62. __forceinline Interval( EmptyTy ) : lower(pos_inf), upper(neg_inf) {}
  63. __forceinline Interval( FullTy ) : lower(neg_inf), upper(pos_inf) {}
  64. };
  65. __forceinline bool isEmpty(const Interval<float>& v) {
  66. return v.lower > v.upper;
  67. }
  68. __forceinline vboolx isEmpty(const Interval<vfloatx>& v) {
  69. return v.lower > v.upper;
  70. }
  71. /*! subset relation */
  72. template<typename T> __forceinline bool subset( const Interval<T>& a, const Interval<T>& b ) {
  73. return (a.lower > b.lower) && (a.upper < b.upper);
  74. }
  75. template<typename T> __forceinline bool subset( const Vec2<Interval<T>>& a, const Vec2<Interval<T>>& b ) {
  76. return subset(a.x,b.x) && subset(a.y,b.y);
  77. }
  78. template<typename T> __forceinline const Vec2<Interval<T>> intersect( const Vec2<Interval<T>>& a, const Vec2<Interval<T>>& b ) {
  79. return Vec2<Interval<T>>(intersect(a.x,b.x),intersect(a.y,b.y));
  80. }
  81. ////////////////////////////////////////////////////////////////////////////////
  82. /// Select
  83. ////////////////////////////////////////////////////////////////////////////////
  84. template<typename T> __forceinline Interval<T> select ( bool s, const Interval<T>& t, const Interval<T>& f ) {
  85. return Interval<T>(select(s,t.lower,f.lower),select(s,t.upper,f.upper));
  86. }
  87. template<typename T> __forceinline Interval<T> select ( const typename T::Bool& s, const Interval<T>& t, const Interval<T>& f ) {
  88. return Interval<T>(select(s,t.lower,f.lower),select(s,t.upper,f.upper));
  89. }
  90. __forceinline int numRoots(const Interval<float>& p0, const Interval<float>& p1)
  91. {
  92. float eps = 1E-4f;
  93. bool neg0 = p0.lower < eps; bool pos0 = p0.upper > -eps;
  94. bool neg1 = p1.lower < eps; bool pos1 = p1.upper > -eps;
  95. return (neg0 && pos1) || (pos0 && neg1) || (neg0 && pos0) || (neg1 && pos1);
  96. }
  97. typedef Interval<float> Interval1f;
  98. typedef Vec2<Interval<float>> Interval2f;
  99. typedef Vec3<Interval<float>> Interval3f;
  100. inline void swap(float& a, float& b) { float tmp = a; a = b; b = tmp; }
  101. inline Interval1f shift(const Interval1f& v, float shift) { return Interval1f(v.lower + shift, v.upper + shift); }
  102. #define TWO_PI (2.0*M_PI)
  103. inline Interval1f sin(Interval1f interval)
  104. {
  105. if (interval.upper-interval.lower >= M_PI) { return Interval1f(-1.0, 1.0); }
  106. if (interval.upper > TWO_PI) { interval = shift(interval, -TWO_PI*floor(interval.upper/TWO_PI)); }
  107. if (interval.lower < 0) { interval = shift(interval, -TWO_PI*floor(interval.lower/TWO_PI)); }
  108. float sinLower = sin(interval.lower);
  109. float sinUpper = sin(interval.upper);
  110. if (sinLower > sinUpper) swap(sinLower, sinUpper);
  111. if (interval.lower < M_PI / 2.0 && interval.upper > M_PI / 2.0) sinUpper = 1.0;
  112. if (interval.lower < 3.0 * M_PI / 2.0 && interval.upper > 3.0 * M_PI / 2.0) sinLower = -1.0;
  113. return Interval1f(sinLower, sinUpper);
  114. }
  115. inline Interval1f cos(Interval1f interval)
  116. {
  117. if (interval.upper-interval.lower >= M_PI) { return Interval1f(-1.0, 1.0); }
  118. if (interval.upper > TWO_PI) { interval = shift(interval, -TWO_PI*floor(interval.upper/TWO_PI)); }
  119. if (interval.lower < 0) { interval = shift(interval, -TWO_PI*floor(interval.lower/TWO_PI)); }
  120. float cosLower = cos(interval.lower);
  121. float cosUpper = cos(interval.upper);
  122. if (cosLower > cosUpper) swap(cosLower, cosUpper);
  123. if (interval.lower < M_PI && interval.upper > M_PI) cosLower = -1.0;
  124. return Interval1f(cosLower, cosUpper);
  125. }
  126. #undef TWO_PI
  127. }