CGAL users discussion list

[ChaoM <>]

Hello Friend:
       I meet a problem when I get two polyhendron intersection. After I get
the outside points and the intersected points, I should reconstruction all
the points!  
       Now  I will show you my detail problem!  What I want is as (the pic1)
shows: two polyhedron intersects
 But my result is wrong (not I want) see pic2
      So I do some simple test ,I draw the less facets polyhedron (pic3) and
I use the Delaunay triangulation , and get good result(pic4) ,but for the
complex facets ,I get wrong result!
  I search the CGAL manual ,and I tried to  use the surface reconstrction
but as I do not quite understand the parameter so I get a terrible result
(pic5).
      So I seek the CGAL_discuss ,someone advice me to use the constraited
Delaunay triangulation,but I could not point out which edge shoule be the
constraited edge!(since m y polyhedron has a lot of facets)!

 Finally ,I will introduce you that my method:(polyhedron A and B)
first, use the AABB tree to find the points of A which outside the B,and the
oppesite!
second, use do intersect func to find the intersected points!
third,I make all the point into 2demison such as (XOY:make the point.z =
0),and use the  the Delaunay Triangulation to make the intersection Result!

Could you help me whether the " constraited Delaunay triangulation " or 
"surface reconstrction mesh" should I use?   or any other good method?  
                                 Thank you very much !
                                                 ChaoM



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