minimum bounding box for a convex polygon

[Bernd Gaertner]

> I am a graduate student from University Of Nebraska. I am looking for
> drawing a minimum bounding box for a given set of points. I could draw a
> convex polygon from the given points, but to draw a minimum bounding box
> around a convex polygon seems confusing in C. 

If you are talking about a point set in the plane, there is C++ code for it 
in the CGAL library, see www.cgal.org. The algorithm computes the smallest
rectangle of any orientation that contains the point set. 

Best regards,
		Bernd.

-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html.