...
首页> 外文期刊>IFAC PapersOnLine >An Extension to Winding Number and Point-in-Polygon Algorithm
【24h】

An Extension to Winding Number and Point-in-Polygon Algorithm

机译:绕组数和多边形点算法的扩展

获取原文
   

获取外文期刊封面封底 >>

       

摘要

This work is an extension of an axis-crossing algorithm to compute winding number for solving point in polygon for an arbitary polygon. Polygons are popular drawings in computer graphics to represent different types of structures with approximations. Solutions for point-in-polygons are many, like even-odd rule, positive-negative number, and winding number. This paper mainly deals with improvements of ‘A winding number and point in polygon algorithm’. Point in polygon is a fundamental problem and has various applications in ray tracing, computer graphics, image processing, gaming applications, robotics, acoustics, geo-science etc. The main focus of this paper explains about winding number for a closed polygon ‘S’, to test whether point ‘P’ lies either inside or outside with respect to positive and negative axis-crossing algorithm method.
机译:这项工作是跨轴算法的扩展,用于计算绕组数以求解任意多边形的多边形中的点。多边形是计算机图形学中流行的图形,用于近似表示不同类型的结构。多边形点的解决方案很多,例如奇偶规则,正负数和缠绕数。本文主要针对“多边形中的绕线数和点”进行改进。多边形中的点是一个基本问题,在射线追踪,计算机图形学,图像处理,游戏应用,机器人技术,声学,地理科学等方面具有多种应用。本文的主要重点是解释闭合多边形“ S”的绕线数,以测试点“ P”相对于正负轴交叉算法方法位于内部还是外部。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号