CGAL users discussion list

[ChaoM <>]

Hello Sebastien:
      Now , I want to tell my final goal !  I want to use CGAL some
functions to  calculate two or more 3D oblects(Polyhedons such as sphere,
cube,cone,clinder... and so on) intersections!  For example ,two cones
intersect with each other, and I wanna to calcuate the intersected parts,and
use OpenGL to draw the whole objects! Not only show the intersected
parts,but also show the whole unions!
      My thought to solve the question is :
      Firstly, Calculate the intersected parts,and find the Object 1's
points which are inside in the Object2! The same procedure conversely!
Remember and store these points!
      Secondly ,judge the intersected points (not inside in the object)
whether the intersected points are on the objects surface!(The method is
using the AABB Tree)
      Finally,take the intersected points and the outside points (except the
inside points) together! And use trianglation mesh or remesh to these
points! And use the OpenGL to draw it out!
      Do you think it is possible to finish my goal?  Or you have some
better methods to solve my question?
Thank you for helping me !





--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Determining-if-a-point-is-inside-a-polyhedron-tp4523460p4657049.html
Sent from the cgal-discuss mailing list archive at Nabble.com.