CGAL users discussion list

[Andre Massing <>]

Hi,

Thanks for the fast reply!

Den 07. juni 2010 22:28, skrev Pierre Alliez:
> hi Andre,
>
> as soon as you add the proper predicates and constructions to your CGAL
> this is going to work.
> for your case you have to add nearest_point_tetrahedron_3 and
> Tetrahedron_3_Sphere_3_do_intersect.h (see example in
> CGAL/include/CGAL/AABB_intersections).

Yes, I have already had a look at it, but (as a non computational 
geometer) was unsure about the effort to implement it.

> as CGAL is an open source project we would happy if you can then
> contribute these functions to CGAL.

Ok, I will have a look at it. Probably
./internal/AABB_tree/nearest_point_triangle_3.h
is the best guiding example?

BTW during the customization of the AABB_tree class for the FEM library 
DOLFIN I added (locally within the source distribution) some code to perform
-tetrahedron-tetrahedron intersection detection
-tetrahedron-bbox intersection intersection detection
and made
-Point-<Whatever> intersections available via do_intersect kernel 
function such that it can be also used for example in the AABB tree.

Maybe there is an interest to have a look at it some day whether it 
worth to be considered?


> best regards,
>
> Pierre Alliez
> INRIA Sophia Antipolis - Mediterranee
> Project-team GEOMETRICA
> http://www-sop.inria.fr/members/Pierre.Alliez/
> Tel: +33 4 92 38 76 77
> Fax: +33 4 97 15 53 95
>
>
> Le 07/06/2010 22:00, Andre Massing a écrit :
> > Hi!
> >
> > At the moment the closest_point function in the AABB_tree class
> > template works only for segments and triangles.
> > Are there any plans in the near future for adding support for
> > tetrahedrons as well?
> >
> > Kind regards,
> > Andre Massing