minimum bounding box for a convex polygon
Sariel Har-Peled
sariel at cs.uiuc.edu
Fri Nov 17 09:57:52 PST 2000
Hi,
For arbitrarily oriented bounding box, people usually use
PCA. For guaranteed approximation in 3d (in near linear time), see:
@inproceedings{bh-eamvb-99,
author = {G.~Barequet and S.~Har-Peled},
title = {Efficiently Approximating the Minimum-Volume
Bounding Box of a Point Set in Three Dimensions},
booktitle = "Proc. 10th ACM-SIAM Sympos. Discrete Algorithms",
year = 1999,
pages = {82--91}
}
http://www.uiuc.edu/~sariel/papers/98/bbox.html
For source code, see:
http://www.uiuc.edu/~sariel/papers/00/diameter/diam_prog.html
bye
--Sariel
On Fri, Nov 17, 2000 at 10:34:57AM +0100, Bernd Gaertner wrote:
>
> > 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.
--
Sariel Har-Peled, CS Dept, UIUC, Urbana, IL, 61801-2987
-------------
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.
More information about the Compgeom-announce
mailing list