Abstract: Generally blind watermarking schemes are more secure in various applications because the cover meshes are absent in the watermark extraction stage, even if they are less robust than non-blind ones. But higher robustness of the blind watermarking schemes is pursued. A blind watermarking algorithm for 3D meshes is proposed in this paper. Firstly, a group of lines through the model center depending on a pseudorandom number is generated. Then the intersection points of these lines and the models surface are chosen as embedding objects. Neighbor balls are centered on these intersection points and all vertices within the balls are adjusted to new positions according to watermark bits. Most lines have two or more intersections with the model and most balls contain several vertices, so by distributing a bit of watermark into multi-ball and multi-vertex make the algorithm be robust against cropping and random noise. Because the algorithm doesnt choose embedding objects according the vertex number, it can resist vertex reorder attack. The algorithm is also robust against translation, rotation and scaling attacks. Finally the robustness is verified by a set of experiments results.