摘要
研究发现了简单多边形裁剪和交并计算的内在一致性．从工程角度出发，以解决不规则物体布局问题为最终目的，提出了解决简单多边形裁剪和交并计算的统一的、切实可行的算法，为不规则物体布局问题的解决奠定了基础．
In this paper, the consistence of the clipping, intersection and union operations of simple polygons has been discovered. Proceeding from engineering point of view, a unified and practical algorithm for these operations is proposed in order to solve irregular packing problems at last. This work has laid a foundation for the solution of irregular packing problems.
出处
《天津大学学报》
EI
CAS
CSCD
1997年第3期281-286,共6页
Journal of Tianjin University(Science and Technology)
关键词
多边形裁剪
交并计算
布局问题
算法
simple polygon, non simple polygon, clipping, intersection, union, packing problem
