Newsgroups: comp.graphics
Path: cantaloupe.srv.cs.cmu.edu!crabapple.srv.cs.cmu.edu!bb3.andrew.cmu.edu!news.sei.cmu.edu!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!swrinde!network.ucsd.edu!pacbell.com!amdahl!netcomsv!netcom.com!thinman
From: thinman@netcom.com (Technically Sweet)
Subject: Re: Surface intersections
Message-ID: <thinmanC5qwLp.DyA@netcom.com>
Organization: International Foundation for Internal Freedom
References: <4251@his.UUCP>
Date: Mon, 19 Apr 1993 19:25:00 GMT
Lines: 19

sp1marse@lina (Marco Seirio) writes:

>I have a problem with intersections between two surfaces.
>Does anybody have a easy to understand algorithm for that or maybe
>even C source??


>      Marco Seirio - In real life sp1marse@caligula.his.s

You also have a severe problem with news headers.

FTP to cs.purdue.edu:pub/vanecek and pull proxima.tar.Z
and proxima.ps.Z.  Tres spif.

-- 

Lance Norskog
thinman@netcom.com
Data is not information is not knowledge is not wisdom.
