Re: [Algorithms] CSG intersection

[Chris P. <bi...@se...>]

Hi,
	Bretton Wades BSP faq describes the basic concepts. There is also
companion CPP source that does CSG union and subtraction. Pretty neat stuff!

http://www.xs4all.nl/~smit/whole.htm

	Regards
	  Chris

At 08:03 AM 8/29/00 -0700, you 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
>
>