Original Post
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!
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!
