• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>National Information Technology Conference >Point in Polygon Determination Algorithm for 2-D Vector Graphics Applications
【24h】

Point in Polygon Determination Algorithm for 2-D Vector Graphics Applications

机译：二维矢量图形应用的多边形确定算法的点

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Point in polygon (PIP) determination is a common problem of determining whether a given point is inside or outside of a given polygon. The polygon is a complex closed object that consists of a number of vertices, where some of its edges might intersect any of the other edges. Determination of PIP in 2-D vector graphics application is an essential part for interaction with objects such as selection using a pointing device. Unlike in the case of basic geometric shapes such as circle and rectangle, evaluation PIP for complex polygons has become complicated. There are algorithms invented for this task, but their implementation is difficult. Ray Casting algorithm is one of the popular algorithms based on simple phenomena, but its implementation is difficult for complex polygons. Therefore, a new algorithm called Progressive Vertical Range Scanning algorithm is introduced in this research paper.
机译：多边形（PIP）确定是确定给定点是否在给定多边形的内部或外部的常见问题。多边形是一个复杂的封闭对象，包括多个顶点，其中一些边缘可能与其他边缘相交。 2-D向量图形应用中的PIP的确定是用于使用指向设备的诸如选择的对象的基本部分。与诸如圆形和矩形的基本几何形状的情况不同，复杂多边形的评估点变得复杂。有针对这项任务发明了算法，但它们的实现很困难。光线铸造算法是基于简单现象的流行算法之一，但其实现对于复杂多边形难以。因此，在本研究论文中介绍了一种名为逐行垂直扫描算法的新算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号