I have a point cloud. I find its 'centre' by averaging the coordinates of each point. I translate the cloud so the average is at the origin (for simplicity sake)
I want to then create a convex shape such that those points are either on its surface or within the shape.
My questions are: Is this soluble without brute force? What do I need to read/understand/search for to learn how to solve this problem. IE is there a theorem that covers this precise problem.
Cheers
This is called Convex Hull. It is computable efficiently, see here for instance: http://en.wikipedia.org/wiki/Convex_hull_algorithms