I have a polygon with N vertices in 3D space. Inside this polygon I have a intersection point P. What I need is to find out three vertices that define the bounding triangle around my intersection point.

I guess I could just select out three vertices then do a check to see if the intersection point is inside these three vertices, if they are not I could then try three other vertices until I finally find someone that fits. But I would rather find a smart method that iterate my polygon vertices one by one, do some checking against the intersection point, then magically give me three vertices around my intersection point

Can anyone give me a hand?