CGAL users discussion list

[Andre Massing <>]

Hi,

first of all, I  want to thank the developer behind the CGAL project for 
providing such a well-documented, open-source computational geometry 
library. We just started to use it in our mesh classes of our FEM 
library dolfin for providing some intersection detection and 
computation, and it is actually quite fun to work with.

Since we intend to use intersection quite heavily I have been wondering, 
why certain intersection test in 3D have not yet been implemented, such 
as the following

‘do_intersect(Point_3&, Point_3&)’
primitive_intersection_test.cpp:79: error: no matching function for call 
to ‘do_intersect(Point_3&, Segment_3&)’
primitive_intersection_test.cpp:81: error: no matching function for call 
to ‘do_intersect(Point_3&, Tetrahedron_3&)’
primitive_intersection_test.cpp:84: error: no matching function for call 
to ‘do_intersect(Segment_3&, Segment_3&)’
primitive_intersection_test.cpp:86: error: no matching function for call 
to ‘do_intersect(Segment_3&, Tetrahedron_3&)’
primitive_intersection_test.cpp:93: error: no matching function for call 
to ‘do_intersect(Tetrahedron_3&, Tetrahedron_3&)’

in particular the Point_3/another primitive are missing. Is there any 
special reason for that, a principle obstacle for implementing this 
correctly or do I just not use the right functions?

I just wonder, since for instance a Triangle_3 Tetrahedron_3 or 
Triangle_3 Triangle_3 intersection or intersection those objects with 
Bbox are implemented.

At a first glance at
http://www.cgal.org/Manual/beta/doc_html/cgal_manual/Kernel_23_ref/Function_do_intersect.html
opposed to the 3D case, the 2d case seems fairly complete.

Maybe you could give me some hints or pointers, how one might supply 
these additional tests?

Kind regards,
Andre