home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #18 / NN_1992_18.iso / spool / comp / graphics / 8816 < prev    next >
Encoding:
Text File  |  1992-08-13  |  869 b   |  24 lines
  1. Newsgroups: comp.graphics
  2. Path: sparky!uunet!caen!umeecs!zip!bagchi
  3. From: bagchi@eecs.umich.edu (Ranjan Drzzzzt!  Bagchi)
  4. Subject: Fastest Polygon Routine?
  5. Message-ID: <BAGCHI.92Aug13220212@sparky.eecs.umich.edu>
  6. Sender: news@zip.eecs.umich.edu (Mr. News)
  7. Organization: Recreational Creationists, Inc.
  8. Date: Fri, 14 Aug 1992 03:02:12 GMT
  9. Lines: 13
  10.  
  11.  
  12.     Something I've found that a lot of graphics texts are
  13. vague on.. what is the fastest algorithm for drawing a bunch
  14. of shaded (just lambertian model) filled polygons?  
  15.  
  16.     Perhaps this is just exceedingly dumb.. but I really
  17. haven't seen any kind of speed comparisons.. In fact... what
  18. *is* a good speed of polygons/sec on say.. a sparc?
  19.  
  20.     Yours cluelessly... rj
  21. --
  22. Ranjan Bagchi:   Di.sigsgvirusuise                 Ranjan.Bagchi@umich.edu
  23. oo   oooo  o oo   ooo oo oo   oo       o o  oooo ooo o       o        oooooooo
  24.