[comp.graphics] HLHS-algorithms for primitives.

m85_orjan@tdb.uu.se (Orjan Kahre - Uppsala University) (07/16/88)

    We are a team (two students actually) who are trying to develop a
    3D Graphic System. The system is being built as a package on top of
    a already excisting 2D Graphic System. Our problrm is that we cannot
    find any Hidden Line Hidden Surface algorithms that don't demand acess
    to the pixel-memory. 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


                               Orjan Kahre
                    Department of Scientific Computing
                            Uppsala University
                                  Sweden   

ksbooth@watcgl.waterloo.edu (Kelly Booth) (07/26/88)

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.