Path: utzoo!attcan!uunet!usna!dfr
From: dfr@usna.MIL (David F. Rogers <dfr@usna>)
Newsgroups: comp.graphics
Subject: Re: A question
Summary: Reference for
Keywords: Polygon Cliping/Hidden lines
Message-ID: <106@usna.MIL>
Date: 15 Jun 88 18:38:40 GMT
References: <1932@pt.cs.cmu.edu>
Organization: U.S. Naval Academy, Annapolis, MD
Lines: 10

The net address given in the article did not work so am posting to
the net. Sorry about that.

There are 2 basic algorithms for doing what you want. The first is
the Sutherland-Hodgman algorithm, the second is the Weiler-Atherton
algorithm.  The Weiler-Atherton algorithm is more general but more
difficult to implement.  Both are described in Procedural Elements 
for Computer Graphics by Rogers, McGraw-Hill.  This should be in
your library. References to the original papers are contained therein
if needed.