Empty convex polygons in almost convex sets

A finite set of points, in general position in the plane, is almost convex if every triple determines a triangle with at most one point in its interior. For every k>2, we determine the maximum size of an almost convex set that does not contain the vertex set of an empty convex k-gon.