#include #include #include #include #include #include // This example shows how to compute a bounding box // for a set of points in two dimensions. struct point2d { float x, y; __host__ __device__ point2d() : x(0) , y(0) {} __host__ __device__ point2d(float _x, float _y) : x(_x) , y(_y) {} }; // bounding box type struct bbox { // construct an empty box bbox() = default; // construct a box from a single point __host__ __device__ bbox(const point2d& point) : lower_left(point) , upper_right(point) {} // construct a box from a single point __host__ __device__ bbox& operator=(const point2d& point) { lower_left = point; upper_right = point; return *this; } // construct a box from a pair of points __host__ __device__ bbox(const point2d& ll, const point2d& ur) : lower_left(ll) , upper_right(ur) {} point2d lower_left, upper_right; }; // reduce a pair of bounding boxes (a,b) to a bounding box containing a and b struct bbox_union { __host__ __device__ bbox operator()(bbox a, bbox b) { // lower left corner point2d ll(thrust::min(a.lower_left.x, b.lower_left.x), thrust::min(a.lower_left.y, b.lower_left.y)); // upper right corner point2d ur(thrust::max(a.upper_right.x, b.upper_right.x), thrust::max(a.upper_right.y, b.upper_right.y)); return bbox(ll, ur); } }; int main() { const size_t N = 40; // allocate storage for points thrust::device_vector points(N); // generate some random points in the unit square thrust::default_random_engine rng; thrust::uniform_real_distribution u01(0.0f, 1.0f); for (size_t i = 0; i < N; i++) { float x = u01(rng); float y = u01(rng); points[i] = point2d(x, y); } // initial bounding box contains first point bbox init(points[0], points[0]); // compute the bounding box for the point set bbox result = thrust::reduce(points.begin(), points.end(), init, bbox_union{}); // print output std::cout << "bounding box " << std::fixed; std::cout << "(" << result.lower_left.x << "," << result.lower_left.y << ") "; std::cout << "(" << result.upper_right.x << "," << result.upper_right.y << ")" << '\n'; return 0; }