Empty convex polygons in almost convex sets

Abstract

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 -; [.gt.] 3, we determine the maximum size of an almost convex set that does not contain the vertex set of an empty convex ;-gon.

Keywords

• Empty
• convex
• polygons
• almost
• convex
• sets