From albanycs!leah:rsb584 Wed Apr  6 17:30:35 1988
Received: by albanycs.albany.edu (5.54/4.8)
	id AA28064; Wed, 6 Apr 88 11:55:31 EST
Date: Wed, 6 Apr 88 12:55:23 EDT
From: albanycs!leah:rsb584 (Raymond S Brand)
Received: by leah.Albany.EDU (5.58/1.1)
	id AA02147; Wed, 6 Apr 88 12:55:23 EDT
Message-Id: <8804061655.AA02147@leah.Albany.EDU>
To: albanycs:beowulf!rsbx
Subject: circlept4.txt

>From trainor@lanai.UUCP Tue Apr  5 18:12:12 1988
Path: leah!itsgw!batcomputer!cornell!uw-beaver!mit-eddie!ll-xn!ames!ucsd!sdcsvax!ucsdhub!hp-sdd!hplabs!sdcrdcf!ucla-cs!lanai!trainor
From: trainor@lanai.cs.ucla.edu (Vulture of Light)
Newsgroups: comp.graphics
Subject: New problem already [was Re: Circle enclosing points]
Message-ID: <10932@shemp.CS.UCLA.EDU>
Date: 5 Apr 88 22:12:12 GMT
References: <wWIfSMy00Xo3A5u1dC@andrew.cmu.edu> <1314@PT.CS.CMU.EDU>
Sender: news@CS.UCLA.EDU
Reply-To: trainor@lanai.UUCP (Vulture of Light)
Organization: UCLA Computer Science Department
Lines: 8

Hey all you, stop posting and read Guy Jacobson's message.  It is very
informative.  The optimal algorithm is O(n).  You can also read about
Megiddo's algorithm in SIAM J. Comput. 12(4), 759-776 (Nov. 1983).

New problem: 

    Given N line segments in the plane, give an algorithm for determining
    a line that passes through all of them, or state that it does not exist.