Euler Rotation and Bounding box calculation of point cloud.

I am completing the OpenCl tutorials I have found online, and would like to move on to a simple ‘real world’ application. The application I have in mind takes a point cloud (1k - 1million xyz doubles), applies a Euler rotation to the point cloud, then calculates a bounding box around the points. I have written traditional c code to solve this problem, but wanted to hear the opinion of someone with more experience if this is the sort of process that would benefit from an OpenCl implementation before I dive in.

I think it’s quite obvious that this problem can be parallelized easily, so yes.