The convex decomposition of arbitrary planar polygon.
任意平面多边形的凸分解。
Based on building the mathematical model of scanning process of Length alterable Line scanning Laser rapid prototyping system, a zoning algorithm for planar polygon is put forward.
在建立激光变长线快速成型系统加工过程的数学模型的基础上，提出了一种可对任意平面图形进行分区处理的分区算法。
Based on the theory of conformal map, map model is built for planar parametric circle, rectangle and polygon regions. The boundary of parametric region rests with the need of tool path planning.
根据协调映射的理论，建立了平面上圆形域、矩形域、多边形域等参数域的映射模型，可根据轨迹规划的需要来选择映射的边界。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.
提出了一种基于有序简单多边形的平面点集凸包快速求取的改进算法，新的算法能够避免极值点重合的问题。
应用推荐