简单多边形顶点凸凹性的快速确定算法  

A FAST ALGORITHM FOR DETERMINING THE CONVEXITYCONCAVITY OF VERTICES OF SIMPLE POLYGON

作　　者：金文华[1,2] 唐卫清 唐荣锡[1,2] 

机构地区：[1]北京航空航天大学制造工程系 [2]中科院计算所CAD开放研究实验室

出　　处：《工程图学学报》1998年第1期66-70,共5页Journal of Engineering Graphics

基　　金：国家自然科学基金

摘　　要：本文深入剖析了平面简单多边形方向（逆时针或顺时针）与顶点凸凹性的内在本质联系，提出了确定顶点凸凹性的快速算法，并解决了根据凸点确定多边形方向的基本问题。本文方法已应用于工厂设计软件ＰＤＳＯＦＴ的工厂模型消隐和平剖图消隐中。实践证明效果很好。おhe internal relation between the orientation (clockwise or anti-clockwise) of polygon and the convexity-concavity of vertices is analysed. A fast algorithm for determing the convexity-concavity of vertices is proposed. And the basic problem of determing the orientation of polygon according to a convex vertices is simply solved. All the method presented in the paper are implemented in the hiding line removal of plant model and orthographic drawings in the plant design software PDSOFT. The results show that method are Satisfactory.

关 键 词：简单多边形 顶点凸凹性 平剖图 计算机图形学 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]