Hw1: Prove cb(n) =\Omega(nlogn), where cb(n) is the minimum number of points required to block all visibility among n points in (strictly) convex position.
Hw2: Prove the Colorful Helly theorem:
If we have d+1 family of convex sets in d-dim such that taking one set from each family always gives a non-empty intersection then there is a family whose sets have a common point.
Hint: This point is the max of the lex min points of the colorful d-tuples.