Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!tut.cis.ohio-state.edu!zaphod.mps.ohio-state.edu!uakari!aplcen!haven!mimsy!nems!dtrc!flitter
From: flitter@dtrc.dt.navy.mil (Flitter)
Newsgroups: comp.graphics
Subject: Re: Sutherland-Hodgman algorithm
Message-ID: <1093@nems.dt.navy.mil>
Date: 26 Feb 90 12:48:55 GMT
References: <9002112200.AA19146@ucbvax.Berkeley.EDU>
Sender: news@nems.dt.navy.mil
Reply-To: flitter@dtrc.dt.navy.mil (Lance Flitter)
Lines: 9

>  I am taking Computer Graphics class.  I can't find an algorithm I need
>in my book.
>  May I have an algorithm of Sutherland-Hodgman?  It is about clipping graph
>algorithm.

  I have the Sutherland-Hodgman algoithm in a book, which I do not have with
  me. If you still need it send me a message to remind me and I will bring the
  book in. It is in the new (as yet unpublished) version of Foley's book. I
  don't know if it is in the old version. I'll have to check.