Digital watermarking has been used extensively in media in recent years. Yet, there are still relatively few techniques for watermarking 3D meshes. In this paper we implement a watermarking algorithm proposed by O. Benedens that encodes a bit string in the distribution of the normals of the faces of the mesh and investigate a method to improve the robustness of 3D mesh watermarking algorithms against connectivity attacks by introducing a mesh regularization step at the watermark insertion and extraction phases. Furthermore, O. Benedens' watermarking technique is augmented to embed bit strings of any length and we suggest a method to measure the similarity of two bit strings in terms of probabilities.