In this study,we extend our previous adaptive steganographic algorithm to support point geometry.For the purpose of the vertex decimation process presented in the previous work,the neighboring information between points is necessary.Therefore,a nearest neighbors search scheme,considering the local complexity of the processing point,is used to determinate the neighbors for each point in a point geometry.With the constructed virtual connectivity,the secret message can be embedded successfully after the vertex decimation and data embedding processes.The experimental results show that the proposed algorithm can preserve the advantages of previous work,including higher estimation accuracy,high embedding-capacity,acceptable model distortion,and robustness against similarity transformation attacks.Most importantly,this work is the first 3D steganographic algorithm for point geometry with adaptation.