Page 338 - 《软件学报》2025年第9期

李佳玮 等: 基于网格行创建条带结构的点在多边形内判断方法 4249

References:
[1] Song WS, Lee JW, Schulzrinne H. Polygon simplification for location-based services using population density. In: Proc. of the 2011
IEEE Int’l Conf. on Communications. Kyoto: IEEE, 2011. 1–6. [doi: 10.1109/icc.2011.5963369]
[2] Ketzner R, Ravindra V, Bramble M. A robust, fast, and accurate algorithm for point in spherical polygon classification with applications
in geoscience and remote sensing. Computers & Geosciences, 2022, 167: 105185. [doi: 10.1016/j.cageo.2022.105185]
[3] Tran TA, Lobov A, Kaasa TH, Bjelland M, Midling OT. CAD integrated automatic recognition of weld paths. The Int’l Journal of
Advanced Manufacturing Technology, 2021, 115(7): 2145–2159. [doi: 10.1007/s00170-021-07186-0]
[4] Žalik B, Kolingerova I. A cell-based point-in-polygon algorithm suitable for large sets of points. Computers & Geosciences, 2001,
27(10): 1135–1145. [doi: 10.1016/S0098-3004(01)00037-1]
[5] Yang S, Yong JH, Sun JG, Gu HJ, Paul JC. A point-in-polygon method based on a quasi-closest point. Computers & Geosciences, 2010,
36(2): 205–213. [doi: 10.1016/j.cageo.2009.06.008]
[6] Li J, Wang WC. Point-in-polygon test method based on center points of grid. Ruan Jian Xue Bao/Journal of Software, 2012, 23(9):
2481–2488 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/4087.htm [doi: 10.3724/SP.J.1001.2012.04087]
[7] Li J. Point-in-polygon tests by applying the ray crossing method locally via grid center points. Int’l Journal of Electrical Engineering:
Trans. of the Chinese Institute of Engineers, 2014, 21(3): 85–92. [doi: 10.6329/CIEE.2014.3.02]
[8] Wang WC, Wang SC. Efficient point-in-polygon tests by grids without the trouble of tuning the grid resolutions. IEEE Trans. on
Visualization and Computer Graphics, 2022, 28(12): 4073–4084. [doi: 10.1109/TVCG.2021.3073919]
[9] Hughes J F, van Dam A, McGuire M, Sklar D F, Foley J D, Feiner S K, Akeley K. Computer Graphics: Principles and Practice. 3rd ed.,
Boston: Pearson Educ, 2014.
[10] Preparata F P, Shamos M I. Computational Geometry: An Introduction. New York: Springer, 2012. [doi: 10.1007/978-1-4612-1098-6]
[11] Hormann K, Agathos A. The point in polygon problem for arbitrary polygons. Computational Geometry, 2001, 20(3): 131–144. [doi: 10.
1016/S0925-7721(01)00012-8]
[12] Berg M, Cheong O, Kreveld M, Overmars M. Computational Geometry: Algorithms and Applications. Berlin: Springer, 2008. [doi: 10.
1007/978-3-540-77974-2]
[13] Li J, Wang WC, Wu EH. Point-in-polygon tests by convex decomposition. Computers & Graphics, 2007, 31(4): 636–648. [doi: 10.1016/j.
cag.2007.03.002]
[14] Rueda AJ, Feito FR. El-REP: A new 2D geometric decomposition scheme and its applications. IEEE Trans. on Visualization and
Computer Graphics, 2011, 17(9): 1325–1336. [doi: 10.1109/TVCG.2010.246]
[15] Wang WC, Li J, Wu EH. 2D point-in-polygon test by classifying edges into layers. Computers & Graphics, 2005, 29(3): 427–439. [doi:
10.1016/j.cag.2005.03.001]
[16] Samet H. Foundations of Multidimensional and Metric Data Structures. Burlington: Morgan Kaufmann, 2006.
[17] Jiménez JJ, Feito FR, Segura RJ. A new hierarchical triangle-based point-in-polygon data structure. Computers & Geosciences, 2009,
35(9): 1843–1853. [doi: 10.1016/j.cageo.2008.09.013]
[18] Haines E. Point in polygon strategies. In: Heckbert PS. Graphics Gems IV. San Diego: Academic Press Professional, Inc., 1994. 24–26.
[19] Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to Algorithms. 4th ed., Cambridge: The MIT Press, 2022.

附中文参考文献:
[6] 李静, 王文成. 基于网格中心点的点在多边形内的高效判定. 软件学报, 2012, 23(9): 2481–2488. http://www.jos.org.cn/1000-9825/4087.
htm [doi: 10.3724/SP.J.1001.2012.04087]

李佳玮(2000－), 男, 硕士生, 主要研究领域为可 王文成(1967－), 男, 博士, 研究员, 博士生导师,
视化, 虚拟现实, 计算机图形学. CCF 高级会员, 主要研究领域为可视化, 虚拟现
实, 计算机图形学, 图像编辑.

王盛春(1991－), 男, 博士, 工程师, 主要研究领

域为计算机图形学, 图像处理.