Abstract: All triangles are rotated in the plane coordinate system so that their longest edges are set horizontally. Each triangular bounding box is placed into atlas space in descending order of its height and slides along the scan lines. The triangular texture is located on the atlas through crash test of its bounding box in the label matrix, thus the texture coordinates of the triangle are gained and its texture is packed into the atlas. The best scaling factor of triangles is tested by bisection method, so that all the triangular bounding boxes just fill the atlas space. Theoretical analysis and experimental results show that the algorithm is simple and stable, and possesses the advantage of storing textures without distortion. Compared with other similar algorithms, the capacity rate of the proposed algorithm can be greatly improved, meanwhile there is no obvious increase in its running time.

Key words: computer applications, texture atlas, triangular mesh, bounding box, capacity rate