NetNews Usenet Archive 1992 #30/NN_1992_30.iso/spool/comp/graphics/12791

Internet Message Format | 1992-12-11 | 836 b

Path: sparky!uunet!elroy.jpl.nasa.gov!usc!hacgate!aic.hrl!shek
From: [e-mail] (Eddie C. Shek)
Newsgroups: comp.graphics
Subject: How to find minimal bounding circle of a polygon?
Message-ID: <[e-mail]>
Date: 11 Dec 92 19:52:22 GMT
Sender: [e-mail]
Lines: 15

I have a set of polygons and would like to bound them by their
respective minimal bounding circles as the first step of
normalization.  And the minimal bounding circle is defined as
the smallest circle that covers the polygon.

Are there any algorithms that find the minimal bounding circle
of a 2-D polygon (or equivalently, a set of 2-D points)?

I'd appreciate any help on the problem.

---------------------------------------------------------------
Eddie C. Shek
Hughes Research Laboratories
[e-mail]
[phone]