Rectangle-packing-based module placement
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Fast and memory efficient polygonal simplification
Proceedings of the conference on Visualization '98
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Least squares conformal maps for automatic texture atlas generation
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Seamster: inconspicuous low-distortion texture seam layout
Proceedings of the conference on Visualization '02
Bounded-distortion piecewise mesh parameterization
Proceedings of the conference on Visualization '02
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
ACM SIGGRAPH 2004 Papers
Feature-based surface parameterization and texture mapping
ACM Transactions on Graphics (TOG)
Iso-charts: stretch-driven mesh parameterization using spectral analysis
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
ABF++: fast and robust angle based flattening
ACM Transactions on Graphics (TOG)
Linear angle based parameterization
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Flow Charts: Visualization of Vector Fields on Arbitrary Surfaces
IEEE Transactions on Visualization and Computer Graphics
A benchmark for 3D mesh segmentation
ACM SIGGRAPH 2009 papers
KinectAvatar: fully automatic body capture using a single kinect
ACCV'12 Proceedings of the 11th international conference on Computer Vision - Volume 2
| Hi-index | 0.00 |
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.