1) polygon operation
多边形运算
1.
Based on the description of graph area and direction of the basic graph element, and by introducing the nodical eigenvalue conception, the polygon operation in mining CAD system was studied in great detail.
从图形区域化描述及图素定向方面着手，引入特征值概念，对采矿计算机辅助设计中的多边形运算进行了全面研究。
2) polygons Boolean operations
多边形布尔运算
3) 2D polygon set operation
2D多边形集合运算
1.
In view of the errors existing in the system affecting the stability of 2D polygon set operation,an algorithm of realizing the 2D polygon set operation was outlined,and five key measures were given to improve the stability of the algorithm.
针对系统中存在的误差会影响2D多边形集合运算的稳定性,简述了二维多边形集合运算的实现算法,给出了提高算法稳定性的5项关键措施。
4) Polygonal line algorithm
多边形算法
1.
In the paper,the new method based on B-spline network,modeling principal curve,is proposed,this method combines the polygonal line algorithm of learning principal curve with B-spline network.
论文提出了一种基于B-样条网络的主曲线建模的新方法,该方法结合学习主曲线的多边形算法和B-样条网络来建立主曲线模型,实验结果表明所提出的方法是简便有效的。
5) polygon motion planning
多边形运动规划
6) polygon vertex algorithm
多边形顶点算法
1.
While polygon vertex algorithm was used for blanking part layout optimization, with optimization precision improving and search space sharply increasing, traditional optimal calculation method has a few defects, such as large calculation quantity, long time consumption.
应用多边形顶点算法进行排样优化计算时,随着优化精度提高,其搜索空间将急剧增大,导致传统的求解方法计算量大、耗时多。
补充资料：凹多边形
Image:11534686683212413.jpg
凹多边形
把一个各边不自交的多边形任意一边向两方无限延长成为一直线，如果多边形的其他各边不在此直线的同旁，那么这个多边形就叫做凹多边形。
凹多边形的内角和的解，其实我们可以通过（n-2）·180来计算。实际上是把大于平角的角划分为两个角（如图）
说明：补充资料仅用于学习参考，请勿用于其它任何用途。