  For arbitrary planar convex domain, we compute the behavior of Christoffel
function up to a constant factor using comparison with other simple reference
domains. The lower bound is obtained by constructing an appropriate ellipse
contained in the domain, while for the upper bound an appropriate
parallelepiped containing the domain is constructed.
  As an application we obtain a new proof of existence of optimal polynomial
meshes in planar convex domains.
