首页 | 本学科首页   官方微博 | 高级检索  
     

简单多边形凸凹性自识别算法
引用本文:陈炳发,钱志峰,廖文和.简单多边形凸凹性自识别算法[J].计算机辅助设计与图形学学报,2002,14(3):214-217.
作者姓名:陈炳发  钱志峰  廖文和
作者单位:南京航空航天大学机电学院,南京,210016
基金项目:江苏省青年科技基金 (G980 17-3 )资助
摘    要:提出一种基于极值顶点构造凸多边形和矢量叉乘的自动识别简单多边形方向性,凸凹性的算法,该算法在稳定性方面采取了有效的措施,避免因极值顶点的奇异性而导致多边形方向性,凸凹性的错误识别,具有良好的可靠性和稳定性,算法原理直观简单,效率高,时间复杂度为O(n).

关 键 词:简单多边形  凸凹性  自动识别算法  计算机图形学
修稿时间:2001年1月15日

An Algorithm for Identifying Convexity-Concavity of A Simple Polygon
Chen Bingfa,Qian Zhifeng,Liao Wenhe.An Algorithm for Identifying Convexity-Concavity of A Simple Polygon[J].Journal of Computer-Aided Design & Computer Graphics,2002,14(3):214-217.
Authors:Chen Bingfa  Qian Zhifeng  Liao Wenhe
Abstract:Based on constructing convex polygon by extremity vertices and computing cross products of polygon's edge vectors, an algorithm for automatic identifying the orientation, convexity concavity of a simply polygon is proposed. The algorithm avoids wrong identification of orientiation and convexity concavity of polygon caused by the misleading property of extremity vertices. It is very simple, straight forward and highly efficient. The complexity of its computing time reaches O(n) .
Keywords:simple polygon  orientation of polygon  convexity  concavity of polygon
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号