This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法,新的算法能够避免极值点重合的问题。
The author proposed a new rotating coordinates convex hull algorithm, and using it in assessing roundness to reduce the computation.
提出了一种新的基于坐标旋转的凸包算法,并将其运用在对圆度误差的最小外接圆评定算法中,减小计算量。
The author proposed a new rotating coordinates convex hull algorithm, and using it in assessing roundness to reduce the computation.
提出了一种新的基于坐标旋转的凸包算法,并将其运用在对圆度误差的最小外接圆评定算法中,减小计算量。
应用推荐