CGAL users discussion list

["Dr. Liu Jianfei" <>]

Dear Colleagues,

I am using Nef_polyhedron_3 and its function locate(Point_3) for point-in-polyhedron test for polyhedrons composed of triangles. However the time to create a Nef_polyhedron_3 is very cost and always fail when the number of triangles is more than 4,000.

In fact, I have just developed a new point-in-polyhedron algorithm, it aims to treat large scale problems( a lot of tests with respect to models composed of huge number of triangles). It is much efficient comparing with results found in literatures.However I need some other codes to do comparison directly and I wounder if the function locate in CGAL is the suitable one. By the way, I'd like to add the codes into CGAL if it is possible.

Thanks a lot.

 

Liu Jianfei