CGAL users discussion list

[Laurent Rineau <>]

On Wednesday 10 October 2007 03:24:21 Dr. Liu Jianfei wrote:
> 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.

Dear Dr. Liu Jianfei, 

I would need that kind of code. Do you plan to release the code under a 
license compatible with CGAL's one? If the answer is yes, can you send me the 
current code, so that I can evaluate that code as a tool in my algorithms 
(for the 3D Surface Mesh Generator, in CGAL)?

I am very interrested by that functionality. As a CGAL developer, I can work 
with you to integrate your code in CGAL, and co-maintain it with you, if you 
agree.

Best regards,

-- 
Laurent Rineau
INRIA - Sophia Antipolis
BP 93, 2004 Route des Lucioles
06902 Sophia Antipolis Cedex FRANCE
Tel: +33 4 92 38 78 62 (Fax: +33.4.97.15.53.95)