CGAL users discussion list

[razafindrazaka faniry harijaona <>]

You are right in the case where the nearest neighbor is not contained in any face. I think that this is not implemented but a naive way is to loop through all faces.

Sorry!!

--- En date de : Sam 13.6.09, Dominik Szczerba <> a écrit :

De: Dominik Szczerba <>
Objet: Re: Re : [cgal-discuss] point inside surface / nearest cell
À:
Date: Samedi 13 Juin 2009, 13h04

Is the closest face guaranteed to contain the closest point? I think generally not...
-- Dominik

razafindrazaka faniry harijaona wrote:
>   May be it's not optimal but you can look for the nearest point and loop through the faces adjacent to this point and test which is the closest.
>
> Regards
>
> --- En date de : *Sam 13.6.09, Dominik Szczerba /<>/* a écrit :
>
>
>     De: Dominik Szczerba <>
>     Objet: [cgal-discuss] point inside surface / nearest cell
>     À:
>     Date: Samedi 13 Juin 2009, 9h49
>
>     Does CGAL provide the following functionality:
>
>     - robust point inside surface test (or at least fast (bbtree based
>     or something) robust intersection tests with triangles)
>
>     - I see a nearest point is available: is there a nearest face search
>     available as well?
>
>     with regards,
>     Dominik
>     -- You are currently subscribed to cgal-discuss.
>     To unsubscribe or access the archives, go to
>     https://lists-sop.inria.fr/wws/info/cgal-discuss
>
>

-- You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss