摘要
主要针对几种典型的多边形顶点凸凹性识别算法进行研究,对它们的计算时间复杂度进行分析,并用VC++6.0实现多边形顶点凸凹性的高效识别。
By the study of several typic methods of determining convexo-concave features for vertices of polygon,the computation time complexity of these methods was analysed, and those methods were implemented in (VC++).
出处
《计算机应用》
CSCD
北大核心
2005年第8期1786-1788,共3页
journal of Computer Applications
关键词
多边形
凸凹性
拓扑映射
特征点
自动识别
矢量运算
<Keyword>polygon
convex-concave feature
topologic mapping
characteristic vertex
automatic recognition
vector operation
