基于三角形包围盒的纹理地图集生成算法  

Algorithm for texture atlas generation based on triangular bounding box

作　　者：江巨浪[1] 黄忠[1] 郑江云[1] 

机构地区：[1]安庆师范学院物理与电气工程学院,安徽安庆246011

出　　处：《吉林大学学报（工学版）》2012年第6期1543-1547,共5页Journal of Jilin University:Engineering and Technology Edition

基　　金：安徽省自然科学基金项目(090412065)

摘　　要：在平面坐标系中旋转所有网络三角形,使其最长边为水平方向。按照包围盒高度递减次序,将每个三角形包围盒在地图集中沿扫描线顺序滑动。通过标签矩阵中的包围盒碰撞测试实现三角形纹理的空间定位,由此获取三角形纹理坐标并完成对地图集的纹理填充。采用二分法测试三角形的最佳缩放系数,使所有三角形包围盒正好填满地图集空间。理论分析与试验结果表明:该算法具有简单稳定、存储纹理不变形的优点,与同类算法相比其空间填充率有较大幅度提高,运行时间没有明显增加。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.

关 键 词：计算机应用 纹理地图集 三角网格 包围盒 空间填充率 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]