1. Liu, N., Lin, B., Lv, G., Zhu, A.X., and Zhou, L., A Delaunay triangulation algorithm based on dual-spatial data organization, PFG–J. Photogramm., Remote Sens. Geoinf. Sci., 2019, pp. 19–31.
2. Ivanovsky, S.A., Preobrazhensky, A.S., and Simonchik, S.K., Algorithms for computational geometry, Convex hulls: Simple algorithms, Comput. Tools Educ., 2007, pp. 3–16.
3. Attali, D., Lieutier, A., and Salinas, L., Vietoris–Rips complexes also provide topologically correct reconstructions of sampled shapes, Proc. 27th Annu. Symp. Computational Geometry, 2011, pp. 491–500.
4. Guennebaud, G. and Gross, M., Algebraic point set surfaces, ACM Trans. Graphics, 2007, vol. 26, no. 3.
5. Qi, C.R., Su, H., Mo, K., and Guibas, L.J., Pointnet: Deep learning on point sets for 3D classification and segmentation, Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2017, pp. 652–660.