Minimum BoundingBox on n-dimensional case I need to develop an algorithm to define the minimum bounding box on an N-dimensional space.

http://en.wikipedia.org/wiki/Minimum_bounding_box

Every reference to this problem that I'm able to find is related to computer graphics (so, only 2 or 3 dimensions). Where can I find some references on the generalised version of this problem?
See chapter 18 here http://goo.gl/pLiEO. If the dimension is really high then bounding box is the wrong creature to work with. A better choice is the ellipsoid. See chapter 16 about John's ellipsoid - it can be computed efficiently using quadratic programming in some cases.