| 任意多边形无叠接靠拢算法的研究与实现 |
| |
| 引用本文： | 邱薇华,张伯钧,邵世煌.任意多边形无叠接靠拢算法的研究与实现[J].东华大学学报(自然科学版),1989(4). |
| |
| 作者姓名： | 邱薇华 张伯钧 邵世煌 |
| |
| 作者单位： | 中国纺织大学自动化及计算机系计算机控制学科组，中国纺织大学自动化及计算机系计算机控制学科组，中国纺织大学自动化及计算机系计算机控制学科组 |
| |
| 摘 要： | CAD 中常遇到这样一个问题:已知一多边形的位置,如何按指定方向放置另一多边形,使这二多边形以最紧密的方式排放,但不发生叠接现象?以往的方法繁琐,计算时间长。本文介绍一种新型的快速靠拢算法。该算法基于投影法上,再适当使用旋转处理和隐藏区域处理,使判断仅基于有限的多边形顶点,简化了处理过程。本算法可适用于任意多边形,可广泛用于计算机辅助机械落料,集成电路 CAD 中的布局,飞机、汽车制造业中的裁剪,制鞋、制帽和服装中的排料等领域,也为自动排料提供了优化算式的基础。
|
| 关 键 词： | 计算机辅助设计 几何 多边形 算法 实现 |
STUDY AND IMPLEMENTATION OF ALGORITHM OF SLIDING IRREGULAR POLYGONS CLOSE TO EACH OTHER WITHOUT OVERLAPPING |
| |
| Qiu Weihua,Zhang bojun,Shao Shihuang.STUDY AND IMPLEMENTATION OF ALGORITHM OF SLIDING IRREGULAR POLYGONS CLOSE TO EACH OTHER WITHOUT OVERLAPPING[J].Journal of Donghua University,1989(4). |
| |
| Authors: | Qiu Weihua Zhang bojun Shao Shihuang |
| |
| Institution: | Department of Automation and Computer Sciences |
| |
| Abstract: | There is a problem in CAD system about how to lay two polygons close to each otherbut without overlapping on the condition that the position of one and the direction of layingout the other arc given.In the past the algorithm to solve the problem is not simple enoughand needs more computing time.This paper presents a new fast algorithm,which is based onthe projection combined with proper rotation and processing for obscure area,thus simpli-fying the processing.The algorithm is suitable for irregular polygons and can be used forCAD blanking of materials block allocation in LSI,layout for airplane and motor making,marker making for garments,cap and shoe,etc.The algorithm also offers an optimal ap-proach for automatic layout. |
| |
| Keywords: | computer aided design geometry polygons algorithm implementation |
| 本文献已被 CNKI 等数据库收录！ |
|
