An extreme triple or 3-set of a finite set S in the plane is a subset
of S of size 3 of the form S boolean AND h, for some half-plane h. We
establish an upper bound [11n/6] + 1 for the number of extreme triples
of any S with \S\ = n greater than or equal to 10. This almost matche
s the known lower bound [11n/6].