[1] ZHANG Y, GE L. Improved moving least squares algorithm for directed projecting onto point clouds [J]. Measurement, 2011,44(10):2008-2019. [2] CHUA C K, LEON K F, LIM C S. Rapid prototyping: principles and applications [M]. River Edge: World Scientific, 2010:25-34. [3] DAI X, CUI H-G, ZHANG L-P, et al. Hexahedral mesh generation for geometry with multi-featured constraints [M]//HUANG D-S, BEVILACQUA V, FIGUEROA J C. Intelligent Computing Theories. LNCS 7995. Berlin: Springer, 2013:612-620. [4] HU C, LI Y, ZHANG Y. Research on repair algorithms for hole and cracks errors of STL models [M]//Computing and Intelligent Systems. Berlin: Springer, 2011:42-47. [5] YANG S, DU Y, SHU S. Reconstruction algorithm of surface meshes based on STL files [J]. Computer Engineering, 2011,37(4):10-11.(杨晟院,杜亚娟,舒适.基于 STL 文件的曲面网格重建算法[J].计算机工程,2011,37(4):10-11.) [6] AN T, DAI N, LIAO W, et al. An efficient algorithm for topological reconstruction of STL data [J]. Mechanical Science and Technology for Aerospace Engineering, 2008,27(8):1031-1034.(安涛,戴宁,廖文和,等.基于红黑树的 STL 数据快速拓扑重建算法[J].机械科学与技术,2008,27(8):1031-1034.) [7] SUN D, LI X, LI Y, et al. Research on high precision and fast generation algorithm of NC tool path for triangular mesh surface [J]. Transactions of the Chinese Society for Agricultural Machinery, 2010,41(7):223-226.(孙殿柱,李心成,李延瑞,等.三角网格曲面高精度刀轨快速生成算法[J].农业机械学报,2010,41(7):223-226.) [8] HOU B, LIU X. The rapid topological reconstruction of 3D-solid and simplification of weighted QEM [C]//Proceedings of the 2013 IEEE International Conference on Vehicular Electronics and Safety. Piscataway: IEEE, 2013:273-277. [9] WANG Z. Fast topological reconstruction algorithm for a STL file [J]. Journal of Computer Applications, 2014,34(9):2720-2724.(王增波.STL格式文件的快速拓扑重建算法[J].计算机应用,2014,34(9):2720-2724.) [10] GAEDE V, GUNTHER O. Multidimensional access methods [J]. ACM Computing Surveys, 1998,30(2):170-231. [11] OOI B C, McDONELL K J, SACKS-DAVIS R. Spatial kd-tree: an indexing mechanism for spatial databases [C]//Proceedings of the 1987 11th Annual International Computer Software and Applications Conference. Piscataway: IEEE, 1987:85. [12] MUJA M, LOWE D. Scalable nearest neighbour algorithms for high dimensional data [EB/OL]. [2015-01-07]. http://www.cs.ubc.ca/research/flann/uploads/FLANN/flann_pami2014.pdf. [13] YAN W, WU W. Data structure [M]. Beijing: Tsinghua University Press, 2002:163-164.(严蔚敏,吴伟民.数据结构[M].北京:清华大学出版社,2002:163-164.) [14] MAHDIRAJI A R, BAUMANN P. Database support for unstructured meshes [J]. Proceedings of the VLDB Endowment, 2013,6(12):1404-1409. [15] PARIS R. Modified half-edge data structure and its applications to 3D mesh generation for complex tube networks [D]. Louisville: University of Louisville, 2013. [16] BRONNIMANN H. Designing and implementing a general purpose halfedge data structure [M]//BRODAL G S, FRIGIONI D, MARCHETTI-SPACCAMELA A. Algorithm Engineering, LNCS 2141. Berlin: Springer, 2001:51-66. |