gdalgorithms-list

[Algorithms] CSG intersection

[Steve L. <sp...@nc...>]

Gentlefolk:

I have what, if you'll excuse the pun, on the surface seems to be a
simple problem but I've been beating my head against it for some time
to no avail.  I have something that sort of works but it runs forever.

I have two (or more) closed surfaces composed of planar polygons of
which I need to extract the intersections, calculate surface areas,
volumes, etc.

Someone recently (like yesterday) mentioned using BSP trees as part of
a method for doing CSG operations.

Could someone be so kind as to point me at a reference (web site,
publication, or book) that discusses this in some detail.  I've done
amount of web searching already but haven't come up with anything.

Direct response to me is fine, since this is, I suspect, slightly off
topic for this list.

Thanks.

							spl

Re: [Algorithms] CSG intersection

[Mark D. <duc...@ll...>]

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).

A list of Thibault's papers is at:

http://www.mcs.csuhayward.edu/~tebo/bio.html

I didn't see a link to an electronic version.  Unfortunately
this was before ACM started collecting electronic versions
of all the siggraph papers in their digital library.  Go hunt down
a friend who has the proceedings or email the authors...

--Mark

Steve Lamont wrote:

> Gentlefolk:
>
> I have what, if you'll excuse the pun, on the surface seems to be a
> simple problem but I've been beating my head against it for some time
> to no avail.  I have something that sort of works but it runs forever.
>
> I have two (or more) closed surfaces composed of planar polygons of
> which I need to extract the intersections, calculate surface areas,
> volumes, etc.
>
> Someone recently (like yesterday) mentioned using BSP trees as part of
> a method for doing CSG operations.
>
> Could someone be so kind as to point me at a reference (web site,
> publication, or book) that discusses this in some detail.  I've done
> amount of web searching already but haven't come up with anything.
>
> Direct response to me is fine, since this is, I suspect, slightly off
> topic for this list.
>
> Thanks.
>
>                                                         spl
> _______________________________________________
> GDAlgorithms-list mailing list
> GDA...@li...
> http://lists.sourceforge.net/mailman/listinfo/gdalgorithms-list

Re: [Algorithms] CSG intersection

[Dave S. <Dav...@sd...>]

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).

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