Sun, ZhiyuRooke, EthanCharton, JeromeHe, YusenLu, JiaBaek, StephenBenes, Bedrich and Hauser, Helwig2020-10-062020-10-0620201467-8659https://doi.org/10.1111/cgf.14012https://diglib.eg.org:443/handle/10.1111/cgf14012In this paper, we propose a novel formulation extending convolutional neural networks (CNN) to arbitrary two‐dimensional manifolds using orthogonal basis functions called Zernike polynomials. In many areas, geometric features play a key role in understanding scientific trends and phenomena, where accurate numerical quantification of geometric features is critical. Recently, CNNs have demonstrated a substantial improvement in extracting and codifying geometric features. However, the progress is mostly centred around computer vision and its applications where an inherent grid‐like data representation is naturally present. In contrast, many geometry processing problems deal with curved surfaces and the application of CNNs is not trivial due to the lack of canonical grid‐like representation, the absence of globally consistent orientation and the incompatible local discretizations. In this paper, we show that the Zernike polynomials allow rigourous yet practical mathematical generalization of CNNs to arbitrary surfaces. We prove that the convolution of two functions can be represented as a simple dot product between Zernike coefficients and the rotation of a convolution kernel is essentially a set of 2 × 2 rotation matrices applied to the coefficients. The key contribution of this work is in such a computationally efficient but rigorous generalization of the major CNN building blocks.3D shape matchingmodelingdatabases of geometric models/shape retrievalcomputer vision ‐ shape recognitionmethods and applications10.1111/cgf.14012204-216