Re: [Algorithms] CSG intersection

[Pierre T. <p.t...@wa...>]

...and I asked the very same question on this list (this is not OT) very
recently - check the archives.

In short, no way to find the relevant papers (Naylor 87 & 90) on the net.
Some useful links have been given regarding BSP+CSG (including Dan Royer's
tutorials, BSP-Solid, etc=> archives)

Needless to say, if someone knows where to find any of the mentioned
articles, just let us know.

Pierre

----- Original Message -----
From: Dave Smith <Dav...@sd...>
To: <gda...@li...>
Sent: Wednesday, August 30, 2000 12:31 AM
Subject: Re: [Algorithms] CSG intersection


> Yes, that's one I've been looking for as well.
> Couldn't find a copy at our local University.
> If someone has this I would love a copy.
> (Snail mail or whatever.)
>
> Thanks,
> -DaveS
>
> Mark Duchaineau wrote:
> >
> > Steve,
> >
> > For BSP-style CSG, the main paper I know about is Thibault's 87
> > siggraph paper:
> >
> > William C. Thibault and Bruce F. Naylor, "Set Operations on Polyhedra
> > Using Binary Space Partitioning Trees," Computer Graphics
> > (Proceedings of SIGGRAPH 87), 21 (4),  pp. 153-162 (July 1987,
> > Anaheim, California).
> _______________________________________________
> GDAlgorithms-list mailing list
> GDA...@li...
> http://lists.sourceforge.net/mailman/listinfo/gdalgorithms-list