The problem of defining correctly geometric objects such as the curvature is a hard one in discrete geometry. In 2009, Ollivier defined a notion of curvature applicable to a wide category of measured metric spaces, in particular to graphs. He named it coarse Ricci curvature because it coincides, up to some given factor, with the classical Ricci curvature, when the space is a smooth manifold. Lin, Lu & Yau, Jost & Liu have used and extended this notion for graphs giving estimates for the curvature and hence the diameter, in terms of the combinatorics. In this paper, we describe a method for computing the coarse Ricci curvature and give sharper results, in the specific but crucial case of polyhedral surfaces.