• Advertisement
Sign in to follow this  

CSG computation problem

This topic is 2318 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 everyone,
I've got a algorithm problem on using the CSG as follows. I put it here in order to get the comments and suggestions on the guys who are interested in it.
I have two intersected curves on two orthogonal planes. I can generate two cylinders whose bottom faces are the areas formed by the curves, and whose heights can be infinite.
Now I would like to make use of the two cylinders to compute a polyhedral, which interpoate both of the two curves. Especially, I want to make use of the CSG of the two cylidners, such as the union, intersection, difference...
Does any one have idea on how to solve it please?
Thanks very much if you have any suggestions!

Share this post


Link to post
Share on other sites
Advertisement
Can you draw a quick picture? It doesn't have to be super artistic, ms paint is fine.

I don''t see what you mean by "whose bottom faces are the areas formed by the curves" Are the curves on the orthogonal planes just circles then?

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement