Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!cs.utexas.edu!helios!gordon
From: gordon@cs.tamu.edu (Dan Gordon)
Newsgroups: comp.graphics
Subject: Re: Graphics Texts etc.
Message-ID: <8279@helios.TAMU.EDU>
Date: 15 Sep 90 23:46:37 GMT
References: <101880023@hpcvlx.cv.hp.com> <23900017@sunc5>
Sender: usenet@helios.TAMU.EDU
Organization: Computer Science Department, Texas A&M University
Lines: 8

In article <23900017@sunc5> mcooper@sunc5.cs.uiuc.edu writes:
<
<[why does Hearn & Baker use an ineffieicent polycon scan conversion alogrithm]
<
<A good question!  I actually haven't looked that close at the algorithms in 
<quite some time.  I can check though.. it probably explains it in the text.

The text doesn't explain anything. It just presents the inefficient algorithm.