首页> 外文会议>Education Technology and Computer Science, 2009. ETCS '09 >An Algorithm for Determining the Orientation and Convexity-Concavity of Simple Polygons
【24h】

An Algorithm for Determining the Orientation and Convexity-Concavity of Simple Polygons

机译:确定简单多边形的方向和凹凸性的算法

获取原文

摘要

This paper presents an algorithm which can determine the orientation of a polygon according to the sequence of extreme vertexes. The convexity and concavity of polygon vertices can be determined by examining whether the orientation of the triangle formed by the vertex and its two adjacent vertices is the same as the orientation of polygon. However, the existing algorithms need calculate three order-determinant or vector multiplication. By this proposed algorithm, the efficiency of a point inclusion test method has been greatly improved. Test results show the high efficiency and stability of this algorithm.
机译:本文提出了一种算法,该算法可以根据极端顶点的顺序确定多边形的方向。多边形顶点的凸凹度可以通过检查由顶点及其两个相邻顶点形成的三角形的方向是否与多边形的方向相同来确定。然而,现有算法需要计算三个阶数或向量乘法。通过该算法,大大提高了点包含测试方法的效率。测试结果表明该算法具有较高的效率和稳定性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号