We classify all regular polyhedra according to their type i.e., the collection of numbers of common neighbours that any pair of distinct vertices may have (polyhedra are planar, $3$-connected graphs). As an application, we recover the classification of planar Deza graphs. Next, we focus on the class of quartic polyhedral Deza graphs, and completely characterise it in terms of medial graphs of certain specific cubic polyhedra. Furthermore, within the aforementioned class of quartic polyhedral Deza graphs, we study the extremal graphs with respect to the ratio of number of triangular faces to the total. In the maximal extreme, these notably coincide with the class of line graphs of cubic polyhedra of girth $5$. We also fully characterise the quartic polyhedra of type $\{0,1,2,3\}$, and in particular we prove that none of them are medial graphs. On one hand our findings fit within the novel research area of common neighbours in graphs. On the other hand, our findings imply general properties of regular planar graphs and regular polyhedra.