Packing Square Tiles into One Texture - PowerPoint PPT Presentation

1 / 13
About This Presentation
Title:

Packing Square Tiles into One Texture

Description:

Pack square texture tiles of the same size into 1 texture. Reduce space loss ... Torus topology texture addresses wrap (GL_REPEAT or D3DADDRESS_WRAP) Can be rotated ... – PowerPoint PPT presentation

Number of Views:45
Avg rating:3.0/5.0
Slides: 14
Provided by: antis
Category:
Tags: one | packing | square | texture | tiles | torus

less

Transcript and Presenter's Notes

Title: Packing Square Tiles into One Texture


1
Packing Square Tiles into One Texture
Philippe Decaudin Fabrice Neyret
GRAVIR/IMAG-INRIA, Grenoble, France
?
  • Eurographics 2004

2
Introduction
  • Aim
  • Pack square texture tiles of the same size into 1
    texture
  • Reduce space loss

10tiles
  • Packing is important
  • Graphic context switching ? performance penalty
  • Easier to manage one texture instead of a set

3
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 (lt 4096)

4
Packing an arbitrary number of tiles
  • Space loss can be substantial
  • E.g., packing 5 tiles

37 unused
55 unused
  • Best known packings
  • Jennings95, Fridman98
  • Complex schemes
  • And still space lost

5
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
  • The trick texture space has special properties
  • Torus topology ? texture addresses wrap
    (GL_REPEAT or
    D3DADDRESS_WRAP)
  • Can be rotated

6
Basic example
7
? 2, ? 2n and ? n2 packing schemes
  • ? 2n scheme ?
    ? n2 scheme ? ? 2 scheme

8
Generalization
  • We can define ? (n2 k2)
  • First, let consider the packing of 5 tiles (22
    12)

9
The ? (n2 k2) packing scheme, with k ? n
  • n ? n square subdivided by 2 sets of parallel
    slanted lines

10
Reachable numbers
  • ? (n2 k2) schemes provide a dense set of
    reachable N with no loss

11
Conclusion
  • We have shown that N tiles can be packed into 1
    texture with no space loss for all N of the
    form
  • Allows many more possible schemes for no loss
    packing than the common schemes
  • For an arbitrary N, it provides a packing with
    little loss
  • Could be extended to 3D textures for cubic
    tilesspace saved for volume data could be
    consequentialKraus-Ertl02, Lefebvre-Neyret03

12
Thanks
Questions ?
  • http//www-imagis.imag.fr/Publications/2004/DN04b

13
Reachable numbers (cont.)
  • Similarities with prime factor decomposition,
    with some gaps.Some primes missing 3, 7, 11,
    19, 23,
Write a Comment
User Comments (0)
About PowerShow.com