Arithmetic circuits are a natural well-studied model for computing multivariate polynomials over a field. In this paper, we study planar arithmetic circuits. These are circuits whose underlying graph is planar. In particular, we prove an \Omega(n\log n) lower bound on the size of planar arithmetic circuits computing explicit bilinear forms ... more >>>