[1] 谢新连,刘毅,何傲.海上施工水域船舶航线规划数学建模及求解[J].重庆交通大学学报(自然科学版),2019,38(9):7-12.
XIE Xinlian, LIU Yi, HE Ao, Mathematicalmodeling and solution of ship route planning in marine construction waters [J]. Journal of Chongqing Jiaotong University (Natural Science),2019,38(9):7-12.
[2] 谢新连,刘超,魏照坤.海洋气象环境影响下的复杂水域船舶路径规划[J].重庆交通大学学报(自然科学版),2021,40(2):1-7,20.
XIE Xinlian, LIU Chao, WEI Zhaokun, Ship path planning in complex water areas under the influence of marine meteorological environment[J]. Journal of Chongqing Jiaotong University (Natural Science),2021,40(2):1-7,20.
[3] 李文杰,唐伯明,杨胜发,等.长江上游黄金航道生态可持续发展评价[J].重庆交通大学学报(自然科学版),2021,40(10):7-13.
LI Wenjie, TANG Boming, YANG Shengfa, et al. Ecological sustainable development assessment of golden waterway in the upper Yangtze River[J]. Journal of Chongqing Jiaotong University (Natural Science),2021,40(10):7-13.
[4] 张新放,吕靖.中国沿海港口发展演变及影响因素分析[J].重庆交通大学学报(自然科学版),2020,39(6):99-107.
ZHANG Xinfang, LYU Jing, Development evolution and influence factors of ports in China coastal[J]. Journal of Chongqing Jiaotong University (Natural Science) ,2020,39(6):99-107.
[5] FEITO F, TORRES J C, URENA A. Orientation, simplicity, and inclusion test for planar polygons[J]. Computers & Graphics, 1995, 19(4):595-600.
[6] FEITO F R, TORRES J C. Inclusion test for general polyhedra[J]. Computers & Graphics, 1997, 21(1):23-30.
[7] MIRAS J R D, FEITO F R. Inclusion test for curved-edge polygons[J]. Computers & Graphics, 1997, 21(6):815-824.
[8] GUO L. Directed-loop method and grid method:New algorithms for inclusion test of planar polygons[J]. Computer Engineering & Applications, 2002, 38(19):119- 122.
[9] ZHANG N. Point inclusion test for simple polygons by the nearest relevant edge[J]. Journal of Computer Aided Design & Computer Graphics, 2004, 16(7):935-938.
[10] ZHAO J. Further discussion on point inclusion test of simple polygons in terms of the nearest relevant edge[J]. Journal of Computer-Aided Design & Computer Graphics, 2007, 19(1):69-72.
[11] MARTINEZ F, RUEDA A J, FEITO F R. The multi-L-REP decom-position and its application to a point-in-polygon inclusion test[J]. Computers & Graphics, 2006, 30 (6):947-958.
[12] LI J, WANG W, WU E. Point-in-polygon tests by convex decomposi-tion[J]. Computers & Graphics, 2007, 31(4):636-648.
[13] ZENGIN R S, SEZER V. A novel point inclusion test for convex polygons based on voronoi tessellations[J]. Applied Mathematics and Computation, 2020,399(1): 126001.
[14] YANG S, YONG J H, SUN J, et al. A point-in-polygon method based on a quasi-closest point[J]. Computers & Geosciences, 2010, 36(2):205-213.
[15] 陈瑞卿, 周健, 虞烈. 一种判断点与多边形关系的快速算法[J]. 西安交通大学学报, 2007, 41(1):59-63.
CHEN Ruiqing, ZHOU Jian, YU Lie. Fast method to determine spatial relationship between point and polygon[J].Journal of Xian Jiaotong University, 2007, 41(1):59-63. |