In order to solve the problem of low capacity in current 3D model information hiding algorithms based on single carrier, we propose a 3D information hiding algorithm based on point cloud increment building upon the research findings of existing single carrier information hiding technology for 3D models. Firstly, the algorithm performs hierarchical clustering on the 3D model using a plane fitting technique, completing the preprocessing of secret information. Secondly, employing a point simplification and compression method, we classify the layered point cloud into four distinct point sets. Finally, utilizing the spatial characteristics between the four point sets, double secret information was embedded through vertex segmentation in two sets of point sets. The application of double embedding ideas in the algorithm greatly improves robustness. The segmentation of points increases the number of point clouds and makes the model smoother, while increasing the algorithm’s capacity. The experimental results show that the information hiding algorithm proposed in this article outperforms the comparison algorithm in all aspects, breaking the balance between robustness, invisibility, and capacity to a certain extent, and has a positive impact on the development of national network security.