simple python algorithm needed in finding bounding box of meshes from an OBJ file
===

I'm trying a packing problem with Python and OBJ files. I'm a novice in python and not sure how to manipulate the OBJ file vertices to find the optimal bounding box. Any sample python code to get me started? Here's a simple box OBJ file to start with which I'll need to fit into a larger container. In short, can object X fit into object Y. Then ultimately how many x can fit into Y with the most optimal solution, but that's for way later.

    # Rhino

v -5 -5 0
v -5 -5 5
v 0 -5 0
v 0 -5 5
vt 0 0
vt 0 1
vt 1 0
vt 1 1
vn 0 -1 0
vn 0 -1 0
vn 0 -1 0
vn 0 -1 0
f 4/4/4 2/2/2 1/1/1 3/3/3
v 0 -5 0
v 0 -5 5
v 0 0 0
v 0 0 5
vt 0 0
vt 0 1
vt 1 0
vt 1 1
vn 1 0 0
vn 1 0 0
vn 1 0 0
vn 1 0 0
f 8/8/8 6/6/6 5/5/5 7/7/7
v 0 0 0
v 0 0 5
v -5 0 0
v -5 0 5
vt 0 0
vt 0 1
vt 1 0
vt 1 1
vn 0 1 0
vn 0 1 0
vn 0 1 0
vn 0 1 0
f 12/12/12 10/10/10 9/9/9 11/11/11
v -5 0 0
v -5 0 5
v -5 -5 0
v -5 -5 5
vt 0 0
vt 0 1
vt 1 0
vt 1 1
vn -1 0 0
vn -1 0 0
vn -1 0 0
vn -1 0 0
f 16/16/16 14/14/14 13/13/13 15/15/15
v -5 -5 0
v 0 -5 0
v -5 0 0
v 0 0 0
vt 0 0
vt 0 1
vt 1 0
vt 1 1
vn 0 0 -1
vn 0 0 -1
vn 0 0 -1
vn 0 0 -1
f 20/20/20 18/18/18 17/17/17 19/19/19
v -5 -5 5
v -5 0 5
v 0 -5 5
v 0 0 5
vt 0 0
vt 0 1
vt 1 0
vt 1 1
vn 0 0 1
vn 0 0 1
vn 0 0 1
vn 0 0 1
f 24/24/24 22/22/22 21/21/21 23/23/23
