返回
A cell-based point-in-polygon algorithm suitable for large sets of points
DOI:10.1016/S0098-3004(01)00037-1.png)
摘要
En 中文
The paper describes a new algorithm for solving the point-in-polygon problem. It is especially suitable when it is necessary to check whether many points are placed inside or outside a polygon. The algorithm works in two steps. First, a grid of cells equal in size is generated, and the polygon is laid on that grid. A heuristic approach is proposed for cell dimensioning. The cells of the grid are marked as being inside, outside, or on the polygon border. A modified flood-fill algorithm is applied for cell classification. In the second step. points are tested individually. If the tested point falls into an inner or an outer cell, the result is returned without any additional calculations. If the cell contains the polygon border, it is possible to determine the local point position. The analysis of tithe complexity shows that the initialization is finished in O(n rootn) time, while the expected time complexity for checking an individual point is O(rootn), where n represents the number of polygon edges. The algorithm works with O(n) space complexity. The paper also gives practical results using artificial and real polygons from a GIS environment. (C) 2001 Elsevier Science Ltd. All rights reserved.
Keyword:
computational geometry
GIS
point-in-polygon
uniform subdivision
polygon
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.4
论文数:
5.0K
被引数:
1.5W
机构
暂无机构信息
引用论文
Cardio-vascular Toxicity in Newly Diagnosed, Transplant-ineligible Multiple Myeloma Patients Treated With Carfilzomib, Cyclophosphamide and Dexamethasone: Results From an Integrated Analysis of 3 Phase I/II Trials新诊断、不适宜移植的多发性骨髓瘤患者接受卡非佐米、环磷酰胺和地塞米松治疗的心血管毒性:来自3项I/II期试验综合分析的结果
Ultrashort polarization splitter based on dual-core photonic crystal fibers with gold wire基于双芯光子晶体光纤和金丝的亚波长偏振分束器

