I have a set of points in 2D which I have filtered to get a counter-clockwise convex hull. I would like to efficiently find the minimum area bounding rectangle which encompasses these points. This will most likely not be the axis aligned bounding box.

I hope this isn't a homework question...

If it's general purpose, just use an axis-aligned bounding box, or (even easier and faster) use a bounding sphere...

If it is a homework/project assignment, I'm not gonna help... but someone else on this board probably will.

Edited by - void* on October 19, 2000 3:33:25 PM

No, it''s not a homework problem. Hell, I haven''t had a homework problem in over 15 years. Anyway, the axis-aligned box won''t work, it''s too big. I need the smallest area box. This means that it will most likely need to be rotated.