We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we either classify all the polyhedra of that type, or construct infinitely many polyhedra of that type, or prove that none exist. This problem is related to the theory of strongly regular and Deza graphs, distances in graphs, and degree sequences. There is potential for application to complex networks and data science.