Path: utzoo!utgpu!watserv1!watmath!att!occrsh!uokmax!munnari.oz.au!samsung!sdd.hp.com!ucsd!ucbvax!agate!pylos.cchem.berkeley.edu!larry
From: larry@pylos.cchem.berkeley.edu (Raymond L. June)
Newsgroups: comp.graphics
Subject: smallest polygon enclosing a point
Message-ID: <1990Jul11.010350.10088@agate.berkeley.edu>
Date: 11 Jul 90 01:03:50 GMT
Sender: usenet@agate.berkeley.edu (USENET Administrator;;;;ZU44)
Reply-To: larry@pylos.cchem.berkeley.edu (Raymond L. June)
Followup-To: comp.graphics
Organization: Department of Chemical Engineering, UCB
Lines: 23

Hello,

	I have a problem I'd like to see if has been solved before and
therefore appeal to this group for a little help. I have a point (call
it the origin) and a number of lines (not colinear) in the same plane.
What I'd like to compute is the smallest polygon formed from the
intersection of the aforementioned lines which encloses the origin.
The 'physics' of the problem says pretty strongly that the lines
will always 'surround' the origin so that I will be rendering a
closed polygon. 

Anybody have an idea about some references? Of course, code would
be wonderful. Email or post - I'll summarize if interest is generated.

Thanks,

      Larry June
+--------+-------------------------------------------------------------+
U.Snail: | Larry June, 201 Gilman Hall, Dept. of Chemical Engineering, |
         | University of California, Berkeley, Berkeley CA 94720       |
ATT:     | 415 642-5927 (worknet) 415 848-3705 (homenet)               |
Internet:| larry@pylos.cchem.berkeley.edu or zeorlj@violet.berkeley.edu|
+--------+-------------------------------------------------------------+