| 任意两个多边形的求交算法 |
| |
| 引用本文： | 张全秋,曾晓帆.任意两个多边形的求交算法[J].华侨大学学报(自然科学版),1995,16(1):111-115. |
| |
| 作者姓名： | 张全秋 曾晓帆 |
| |
| 作者单位： | 华侨大学计算机科学系 |
| |
| 摘 要： | 对Ａ．Ｍａｎｇｅｎ的算法进行改进，使之在计算机辅助排样应用中效率更高，通用性更强。
|
| 关 键 词： | 排样 多边形 求交算法 计算机辅助排样 |
An Algorithm for Computing the Intersection Polygon of Two Arbitrary Polygons |
| |
| Zhang Quanhuo, Zeng Xiaofan, Fan Huilin, Yu Jian.An Algorithm for Computing the Intersection Polygon of Two Arbitrary Polygons[J].Journal of Huaqiao University(Natural Science),1995,16(1):111-115. |
| |
| Authors: | Zhang Quanhuo Zeng Xiaofan Fan Huilin Yu Jian |
| |
| Abstract: | An improvement is made on the alogorithm, with the result that it can be more efficiently and commonly applied to the computer-aided layout in tailoring. |
| |
| Keywords: | layout in tailoring polygon intersection algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
