CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Because it is stated in the problem definition that the query point is
known to be on a face so the closest face for that point is
the face containing it.

At least that's what I understood when I read "This given point is
guaranteed to be coplanar to the mesh *somewhere*"

Sebastien.

On 10/25/19 4:36 PM, Andreas Fabri wrote:
> I do  not see where that helps.  A point coplanar to a face  f
> can be far away from f and be close to a non-coplanar face.
>
>        ************
>        *                      *
>   p   f1                     ***f2**
>        *                                    *
>        ******************
>
> p is coplanar with f2 but f1 is closer
>
> On 10/25/2019 4:27 PM, Sebastien Loriot (GeometryFactory) wrote:
> > You can use AABB_tree::closest_point_and_primitive()
> >
> > https://doc.cgal.org/latest/AABB_tree/classCGAL_1_1AABB__tree.html#a1b3ac9521fd7257f760deafff3743437 
> >
> >
> > Sebastien.
> >
> > On 10/24/19 6:05 PM, aseverino wrote:
> > > Hello,
> > >
> > > I'm trying to find the face index that has its points coplanar to 
> > > another
> > > given point. This given point is guaranteed to be coplanar to the mesh
> > > *somewhere*.
> > >
> > > Is there a more optimized method to find that face without having to 
> > > iterate
> > > over all of them (in the worst case)?
> > >
> > >
> > >
> > > --
> > > Sent from: http://cgal-discuss.949826.n4.nabble.com/
> --
> Andreas Fabri, PhD
> Chief Officer, GeometryFactory
> Editor, The CGAL Project
>
> phone: +33.492.954.912    skype: andreas.fabri