home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!cs.utexas.edu!wupost!waikato.ac.nz!aukuni.ac.nz!cs18.cs.aukuni.ac.nz!jwil1
- Newsgroups: comp.graphics
- Subject: Re: Weiler-Atherton polygon clipper
- Message-ID: <1992Sep10.012608.9519@cs.aukuni.ac.nz>
- From: jwil1@cs.aukuni.ac.nz (TMOTA)
- Date: Thu, 10 Sep 1992 01:26:08 GMT
- Sender: jwil1@cs.aukuni.ac.nz (TMOTA)
- References: <1992Sep8.041100.21029@cs.aukuni.ac.nz> <1992Sep9.001150.15789@cs.ucla.edu>
- Organization: Computer Science Dept. University of Auckland
- Lines: 15
-
- david@oahu.cs.ucla.edu (David Dantowitz) writes:
- >Check out Communications of the ACM, from July '92 for a new article
- >on polygon clipping.
-
- Thanks... in a couple of months when it reaches NZ I'll look out for it! ;-)
- ^^^^^^ :-(
-
- ...but back to the original question... I'm after source code for a Weiler-
- Atherton clipper. I am developing my own clipping algorithms, and I want to
- use Weiler-Atherton as a benchmark for them. If anyone can oblige I would
- be most grateful.
- --
- _________________ "I'd like to answer this question in two ways:
- /____ _ _/_ __ First in my normal voice, and then
- // / //_//_ /_/ in a silly, high-pitched whine." (Monty Python)
-