Packing Square Tiles into One Texture.ppt

Packing Square Tiles into One Texture Packing Square Tiles into One Texture Eurographics 2004 Introduction Aim Pack square texture tiles of the same size into 1 texture Reduce space loss Introduction (cont.) Why packing N tiles with no space loss is difficult ? Texture size is constrained w / h = 2 i ? w and h are bounded ( 4096) Packing an arbitrary number of tiles Space loss can be substantial E.g., packing 5 tiles Our packing scheme We propose a packing scheme with no loss for many N Ranges of uncovered numbers are small? loss greatly reduced for other values of N Basic example ? 2, ? 2n and ? n2 packing schemes ? 2n scheme ? ? n2 scheme ? ? 2 scheme Generalization We can define ? (n2 + k2) … First, let consider the packing of 5 tiles (22 + 12) The ? (n2 + k2) packing scheme, with k ? n n ? n square subdivided by 2 sets of parallel slanted lines Reachable numbers ? (n2 + k2) schemes provide a dense set of reachable N with no loss Conclusion We have shown that N tiles can be packed into 1 texture with no space loss for all N of the form Thanks… http://www-imagis.imag.fr/Publications/2004/DN04b Reachable numbers (cont.) Similarities with prime factor decomposition, with some gaps.Some primes missing: 3, 7, 11, 19, 23,… * * Philippe Decaudin Fabrice Neyret GRAVIR/IMAG-INRIA, Grenoble, France ? Packing is important Graphic context switching ? performance penalty Easier to manage one texture instead of a set 10tiles For others N, efficient schemes are not obvious… Trivial packing with no space loss: N = 2n and N = n2 N = 20 21 22 23 24 … N = 22 32 … 10 tiles 17 tiles Best known packings [Jennings’95, Fridman’98] Complex schemes And still space lost 37% unused 55% unused The trick: texture space has special properties Torus topology ? texture addresses wrap  (GL_REPEAT or