This paper presents an algorithm for determining convexo-concave venices of an arbitrary polygon. The algorithm requires O ( n2 logn ) multiplications and O ( n2 ) comparisons. 本文提出一种确定任意多边形凸凹顶点的算法.该算法的时间复杂性为O(n2logn)次乘法和O(n2)次比较。
Determining Convexo-Concave(CC) Vertices of Polygon By Topological Mapping 基于拓扑映射的多边形顶点凸凹判别算法
A Study of the Stress Intensity Factors of Multiple Semi Elliptical Cracks REHEATING FURNACE WITH CONVEXO-CONCAVE INTERNAL WALLS 厚壁圆筒内壁半椭圆形多裂缝应力强度因子的研究
Identifying for the Convexo-concave of Peripherals Based on Chain Code Difference 基于链码差的边界凸凹性判别