box.h

Go to the documentation of this file.

// ======================================================================== //
// Copyright 2018-2019 Ingo Wald                                            //
//                                                                          //
// Licensed under the Apache License, Version 2.0 (the "License");          //
// you may not use this file except in compliance with the License.         //
// You may obtain a copy of the License at                                  //
//                                                                          //
//     http://www.apache.org/licenses/LICENSE-2.0                           //
//                                                                          //
// Unless required by applicable law or agreed to in writing, software      //
// distributed under the License is distributed on an "AS IS" BASIS,        //
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. //
// See the License for the specific language governing permissions and      //
// limitations under the License.                                           //
// ======================================================================== //
 
#pragma once
 
#include "vec.h"
 
namespace owl {
  namespace common {
 
    template<typename T>
    struct interval {
      typedef T scalar_t;
      inline __both__ interval() 
        : lower(owl::common::empty_bounds_lower<T>()),
          upper(owl::common::empty_bounds_upper<T>())
      {}
      inline __both__ interval(T begin, T end) : begin(begin), end(end) {}
    
      union {
        T begin;
        T lower;
        T lo;
      };
      union {
        T end;
        T upper;
        T hi;
      };
 
      inline __both__ bool contains(const T &t) const { return t >= lower && t <= upper; }
      inline __both__ bool is_empty() const { return begin > end; }
      inline __both__ T center() const { return (begin+end)/2; }
      inline __both__ T span() const { return end - begin; }
      inline __both__ T diagonal() const { return end - begin; }
      inline __both__ interval<T> &extend(const T &t)
      { lower = min(lower,t); upper = max(upper,t); return *this; }
      inline __both__ interval<T> &extend(const interval<T> &t)
      { lower = min(lower,t.lower); upper = max(upper,t.upper); return *this; }
      inline __both__ interval<T> including(const T &t)
      { return interval<T>(min(lower,t),max(upper,t)); }
    
      static inline __both__ interval<T> positive()
      {
        return interval<T>(0.f,owl::common::open_range_upper<T>());
      }
    };
 
    template<typename T>
    inline __both__ std::ostream &operator<<(std::ostream &o, const interval<T> &b)
    {
#ifndef __CUDACC__
      o << "[" << b.lower << ":" << b.upper << "]";
#endif
      return o;
    }
  
    template<typename T>
    inline __both__ interval<T> build_interval(const T &a, const T &b)
    { return interval<T>(min(a,b),max(a,b)); }
  
    template<typename T>
    inline __both__ interval<T> intersect(const interval<T> &a, const interval<T> &b)
    { return interval<T>(max(a.lower,b.lower),min(a.upper,b.upper)); }
  
    template<typename T>
    inline __both__ interval<T> operator-(const interval<T> &a, const T &b)
    { return interval<T>(a.lower-b,a.upper-b); }
 
    template<typename T>
    inline __both__ interval<T> operator*(const interval<T> &a, const T &b)
    { return build_interval<T>(a.lower*b,a.upper*b); }
  
    template<typename T>
    inline __both__ bool operator==(const interval<T> &a, const interval<T> &b)
    { return a.lower == b.lower && a.upper == b.upper; }
  
    template<typename T>
    inline __both__ bool operator!=(const interval<T> &a, const interval<T> &b)
    { return !(a == b); }
 
 
  
    template<typename T>
    struct box_t {
      typedef T vec_t;
      typedef typename T::scalar_t scalar_t;
      enum { dims = T::dims };
 
      inline __both__ box_t()
        : lower(owl::common::empty_bounds_lower<typename T::scalar_t>()),
          upper(owl::common::empty_bounds_upper<typename T::scalar_t>())
      {}
 
      // /*! construct a new, origin-oriented box of given size */
      // explicit inline __both__ box_t(const vec_t &box_size)
      //   : lower(vec_t(0)),
      //     upper(box_size)
      // {}
      explicit inline __both__ box_t(const vec_t &v)
        : lower(v),
          upper(v)
      {}
 
      inline __both__ box_t(const vec_t &lo, const vec_t &hi)
        : lower(lo),
          upper(hi)
      {}
 
      inline __both__ box_t including(const vec_t &other) const
      { return box_t(min(lower,other),max(upper,other)); }
      inline __both__ box_t including(const box_t &other) const
      { return box_t(min(lower,other.lower),max(upper,other.upper)); }
 
    
      inline __both__ box_t &extend(const vec_t &other) 
      { lower = min(lower,other); upper = max(upper,other); return *this; }
      inline __both__ box_t &extend(const box_t &other) 
      { lower = min(lower,other.lower); upper = max(upper,other.upper); return *this; }
    
    
      inline __both__ interval<scalar_t> get_slab(const uint32_t dim)
      {
        return interval<scalar_t>(lower[dim],upper[dim]);
      }
    
      inline __both__ bool contains(const vec_t &point) const
      { return !(any_less_than(point,lower) || any_greater_than(point,upper)); }
 
      inline __both__ bool overlaps(const box_t &other) const
      { return !(any_less_than(other.upper,lower) || any_greater_than(other.lower,upper)); }
 
      inline __both__ vec_t center() const { return (lower+upper)/(typename vec_t::scalar_t)2; }
      inline __both__ vec_t span()   const { return upper-lower; }
      inline __both__ vec_t size()   const { return upper-lower; }
 
      inline __both__ typename long_type_of<typename T::scalar_t>::type volume() const
      { return owl::common::volume(size()); }
    
      inline __both__ bool empty() const { return any_less_than(upper,lower); }
 
      vec_t lower, upper;
    };
  
    // =======================================================
    // default functions
    // =======================================================
 
    template<typename T>
    inline __both__ typename long_type_of<T>::type area(const box_t<vec_t<T,2>> &b)
    { return area(b.upper - b.lower); }
 
    template<typename T>
    inline __both__ typename long_type_of<T>::type area(const box_t<vec_t<T,3>> &b)
    {
      const vec_t<T,3> diag = b.upper - b.lower;
      return 2.f*(area(vec_t<T,2>(diag.x,diag.y))+
                  area(vec_t<T,2>(diag.y,diag.z))+
                  area(vec_t<T,2>(diag.z,diag.x)));
    }
 
    template<typename T>
    inline __both__ typename long_type_of<T>::type volume(const box_t<vec_t<T,3>> &b)
    {
      const vec_t<T,3> diag = b.upper - b.lower;
      return diag.x*diag.y*diag.z;
    }
 
    template<typename T>
    inline __both__ std::ostream &operator<<(std::ostream &o, const box_t<T> &b)
    {
#ifndef __CUDACC__
      o << "[" << b.lower << ":" << b.upper << "]";
#endif
      return o;
    }
 
    template<typename T>
    inline __both__ box_t<T> intersection(const box_t<T> &a, const box_t<T> &b)
    { return box_t<T>(max(a.lower,b.lower),min(a.upper,b.upper)); }
  
    template<typename T>
    inline __both__ bool operator==(const box_t<T> &a, const box_t<T> &b)
    { return a.lower == b.lower && a.upper == b.upper; }
  
    template<typename T>
    inline __both__ bool operator!=(const box_t<T> &a, const box_t<T> &b)
    { return !(a == b); }
 
 
    
  
    // =======================================================
    // default instantiations
    // =======================================================
  
#define _define_box_types(T,t)                  \
    typedef box_t<vec_t<T,2>> box2##t;          \
    typedef box_t<vec_t<T,3>> box3##t;          \
    typedef box_t<vec_t<T,4>> box4##t;          \
    typedef box_t<vec3a_t<T>> box3##t##a;       \
  
    _define_box_types(short int,s);
    _define_box_types(unsigned short int,us);
    _define_box_types(int,i);
    _define_box_types(unsigned int,ui);
    _define_box_types(float,f);
  
#undef _define_box_types
 
  } // ::owl::common
} // ::owl