Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!samsung!munnari.oz.au!goanna!minyos.xx.rmit.oz.au!godzilla!mg From: mg@godzilla.cgl.rmit.oz.au (Mike Gigante) Newsgroups: comp.graphics Subject: Re: 2d polygon intersection Keywords: 2d polygon intersection Message-ID: Date: 2 Jun 91 21:24:38 GMT References: <1991Jun02.174356.12556@eng.cam.ac.uk> Sender: usenet@minyos.xx.rmit.oz.au (Njuiz noveles nova newes) Organization: RMIT Computer Centre, Melbourne Australia. Lines: 12 Originator: mg@ Since you are in the UK, you can probably contact Alan Middleditch at the Polytechnic of Central London (School of Engineering and Science) who has worked on robust set operations for (convex) 2d polygons. One reference is in "Theoretcal Foundations of Computer Graphics and CAD" Edited by R.A. Earnshaw. The publisher is Springer (NATO ASI series) Alan lso had a few TRs which I can't lay me hand on just now (moving pains) Mike Gigante ACGC Royal Melbourne Institute of Technology