comp.graphics.algorithms

  Algorithms used in producing computer graphics.

  A forum for the discussion of the algorithms used in the process of
  generating computer graphics.  These algorithms may be recently
  proposed in published journals or papers, old or previously
  known algorithms, or hacks used incidental to the process of
  computer graphics.  The scope of these algorithms may range
  from an efficient way to multiply matrices, all the way to a
  global illumination method incorporating raytracing, radiosity,
  infinite spectrum modeling, and perhaps even mirrored balls and
  lime jello.
  This group serves as a forum for programmers and researchers to
  exchange ideas and ask questions on recent papers or current research 
  related to computer graphics.

  Frequently Asked Questions about Gamma
    From: Poynton@inforamp.net (Charles A. Poynton)
    Posted: unknown ()

  Frequently Asked Questions about Color, part */*
    From: Poynton@inforamp.net (Charles A. Poynton)
    Posted: unknown ()

  Binary Space Partitioning Trees FAQ
    Frequently asked questions about Binary Space Partitioning trees.
    <graphics/bsptree-faq>
    From: BSP-FAQ <bsp-faq@graphics.cornell.edu>
    Posted: monthly (26 Sep 1995 11:28:16 -0400)

  Computer Graphics Algorithms FAQ
    This posting contains a list of Frequently Asked Questions (and
      their answers) about computer graphics algorithms. It should be
      read by anyone who wishes to post to the
      comp.graphics.algorithms newsgroup.
    <graphics/algorithms-faq>
    From: ansont@hookup.net (Anson Tsao)
    Posted: bi-weekly (9 Oct 1994 10:00:06 GMT)

  Readers: 39000 (0.6%) {92%}        Mesgs per month/day: 1036/35    {67%}
  Crossposting: 10% {40%}            Megs  per month/day: 1.6/0.053  {68%}
  Sites reciving this Group: 69%     Cost ratio ($US/month/rdr): 0.03