首页> 外文会议>Asia-Pacific Signal and Information Processing Association Annual Summit and Conference >Point-in-polygon tests by determining grid center points in advance
【24h】

Point-in-polygon tests by determining grid center points in advance

机译:通过预先确定网格中心点进行多边形测试

获取原文

摘要

This paper presents a new method for point-inpolygon tests via uniform grids. It consists of two stages, with first to construct a uniform grid and determine the inclusion property of every grid center point, and the second to determine a query point by the center point of its located grid cell. In this way, the simple ray crossing method can be used locally to perform point-in-polygon tests quickly. When O(Ne) grid cells are constructed, as used in many grid-based methods, our new method can considerably reduce the storage requirement and the time on grid construction and determining the grid center points in the first stage, where Ne is the number of polygon edges. As for answering a query point at the second stage, the expected time complexity is O(1) in general. Experiments show that our new method can be several times faster than existing methods at the first stage and an order of magnitude faster at the second stage. Benefited from its high speed and less storage requirement, our new method is very suitable for treating large-scale polygons and dynamic cases, as shown in our experiments.
机译:本文提出了一种通过均匀网格进行点对多边形测试的新方法。它包括两个阶段,第一个阶段是构建统一的网格并确定每个网格中心点的包含属性,第二个阶段是通过其所在网格单元的中心点确定查询点。这样,可以在本地使用简单的射线穿越方法来快速执行多边形点测试。在构造O(Ne)网格像元时(如许多基于网格的方法中所使用的那样),我们的新方法可以大大减少存储需求和网格构建的时间,并在第一阶段确定网格中心点,其中Ne是个多边形边缘。至于在第二阶段回答查询点,通常预期的时间复杂度为O(1)。实验表明,我们的新方法在第一阶段的速度可以比现有方法快几倍,而在第二阶段则要快一个数量级。如我们的实验所示,得益于其高速和较少存储需求,我们的新方法非常适合于处理大型多边形和动态情况。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号