• Advertisement

Archived

This topic is now archived and is closed to further replies.

Computing Solid Geometry Using Boolean Set Operators

This topic is 5653 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

hi, i´m searching for a good approach to construct solid geometry using boolean set operators (also called CSG). the problem is that i don´t know which algorithm to use for the calculating of, for example, a subtraction of two solids. my first idea was, i could do line/line intersection tests to find possible intersection points. if a line intersects with another line, i would add the point of that line that lies outside the convex hull of the other solid to the new set of vertices. but i´m not sure how to implement this. it would be very interesting to know if one has experience with this topic and could give me some hints. thanks Gammastrahler

Share this post


Link to post
Share on other sites
Advertisement
There''s an excellent paper titled Set Operations on Polyhedra Using Binary Space Partitioning Trees by William Thibault and Bruce Naylor.

Share this post


Link to post
Share on other sites

  • Advertisement