The coding graphics-matching and packing (nesting) of arbitrary graphics based on bitmap

被引:0
作者
Song, YA [1 ]
Ye, JW [1 ]
Deng, FQ [1 ]
Feng, SY [1 ]
机构
[1] S China Univ Technol, Guangzhou 510640, Peoples R China
来源
2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS | 2003年
关键词
packing; graphics-matching; bitmap;
D O I
10.1109/ICMLC.2003.1260073
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper the coding, graphics-matching and packing (nesting) of arbitrary graphics based on bitmap are discussed. It is convenient to compute the area and the enveloping graphics of arbitrary graphics and detect the collision of two arbitrary graphics by the change of the colors. The results of experiments show that the method is effective.
引用
收藏
页码:2936 / 2939
页数:4
相关论文
共 3 条
[1]   A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms [J].
Ramesh Babu, A. ;
Ramesh Babu, N. .
CAD Computer Aided Design, 2001, 33 (12) :879-891
[2]   Densest translational lattice packing of non-convex polygons [J].
Milenkovic, VJ .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2002, 22 (1-3) :205-222
[3]  
SONG Y, 2003, S DEV SHIP BUILD SHI, P174