This algorithm can quickly report if kernel of simple polygon is empty, and can quickly get the point list of the kernel when the kernel exists.
该算法可以较快地对多边形的核为空的情况加以报告,而且在有核的情况下快速求解到核多边形的顶点序列。
This paper inspects the properties in constitution of kernel of simple polygon, and a new algorithm for calculating the kernel of a simple polygon is proposed combined with the existing achievement.
考察了简单多边形的核在构成方面的性质,结合已有的成果,提出了一种求简单多边形核的新算法。
This paper inspects the properties in constitution of kernel of simple polygon, and a new algorithm for calculating the kernel of a simple polygon is proposed combined with the existing achievement.
考察了简单多边形的核在构成方面的性质,结合已有的成果,提出了一种求简单多边形核的新算法。
应用推荐