Efficient Packing of Arbitrarily Shaped Charts for Automatic Texture Atlas Generation
| dc.contributor.author | Nöll, Tobias | en_US |
| dc.contributor.author | Stricker, Didier | en_US |
| dc.contributor.editor | Ravi Ramamoorthi and Erik Reinhard | en_US |
| dc.date.accessioned | 2015-02-27T14:45:40Z | |
| dc.date.available | 2015-02-27T14:45:40Z | |
| dc.date.issued | 2011 | en_US |
| dc.description.abstract | Texture atlases are commonly used as representations for mesh parameterizations in numerous applications including texture and normal mapping. Therefore, packing is an important post-processing step that tries to place and orient the single parameterizations in a way that the available space is used as efficiently as possible. However, since packing is NP hard, only heuristics can be used in practice to find near-optimal solutions. In this publication we introduce the new search space of modulo valid packings. The key idea thereby is to allow the texture charts to wrap around in the atlas. By utilizing this search space we propose a new algorithm that can be used in order to automatically pack texture atlases. In the evaluation section we show that our algorithm achieves solutions with a significantly higher packing efficiency when compared to the state of the art, especially for complex packing problems. | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2011.01990.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2011.01990.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Efficient Packing of Arbitrarily Shaped Charts for Automatic Texture Atlas Generation | en_US |