An efficient video coding scheme is significant for video storage and transmission, especially for the massive data of three-dimensional (3D) video. For 3D video coding, three-dimensional high efficiency video coding (3D-HEVC) supports the multi-view video with depth (MVD) format. Both texture and depth sequences for each view should be coded, and the coding process of depth map follows the principle of texture sequence, which increases the computational complexity of 3D-HEVC. Therefore, two fast algorithms for 3D-HEVC depth map coding are proposed to reduce the coding complexity of 3D-HEVC based on the gray-level co-occurrence matrix (GLCM). With GLCM, the texture complexity of the depth map in 3D-HEVC can be effectively described, which enables the prejudgment of CU segmentation depth and candidate intra-prediction modes. Experimental results show that the proposed algorithms can save about 19.1% and 20.2% coding time compared with the 3D-HEVC standard, and outperform the state-of-the-art fast algorithm by 5.7% and 6.8% time-saving, respectively, while keeping almost the same coding efficiency and quality of synthesized views.