Path: utzoo!utgpu!water!watmath!watcgl!ksbooth
From: ksbooth@watcgl.waterloo.edu (Kelly Booth)
Newsgroups: comp.graphics
Subject: Re: HLHS-algorithms for primitives.
Message-ID: <5298@watcgl.waterloo.edu>
Date: 26 Jul 88 01:26:27 GMT
References: <155@tdb.uu.se>
Reply-To: ksbooth@watcgl.waterloo.edu (Kelly Booth)
Organization: U. of Waterloo, Ontario
Lines: 10

In article <155@tdb.uu.se> m85_orjan@tdb.uu.se (Orjan Kahre - Uppsala University) writes:
>
>                         What I wonder is: are there any algorithms for
>    hidden line hidden surface removal that uses primitives (in any graphic
>    system) AND not the pixel memory

Yes.  Look in any of the standard text books.  Newman and Sproull or Foley
and Van Dam, for example.  In fact, only the z-buffer algorithm "requires"
the frame buffer.  All other hidden line or hidden surface algorithms either
produce output in a different format or have easy variants that do so.