We wish to divide a cake among some collection of people (who may have very different notions of the comparative value of pieces of cake) in a way that is both "fair" and "efficient." We explore the meaning of these terms, introduce two geometric tools to aid our analysis, and present a proof (due to Dietrich Weller) that establishes the existence of cake divisions that are both fair and efficient.