Title Abstract Downloads Bibtex


Atlas Refinement with Bounded Packing Efficiency

 

Hao-Yu Liu     Xiao-Ming Fu    Chunyang Ye      Shuangming Chai    Ligang Liu    

University of Science and Technology of China   

ACM Transactions on Graphics (SIGGRAPH) 38(4), 2019.


Figure 1

Figure 1: Refining input parameterized charts to obtain packing efficiency that is greater than or equal to the given bounds. Compared to the inputs that have low packing eff iciency and are not bijective, our method significantly improves the packing efficiency and ensures the bijection. We set the packing efficiency bounds as 80% for these two models. PE, BL, CN, Ed, and E2 represent the packing efficiency, the boundary length, the number of charts, the symmetric Dirichlet distortion metric with respect to the input 3D surface, and the symmetric Dirichlet distortion metric with respect to the input atlas, respectively.


Abstract



We present a novel algorithm to refine an input atlas with bounded packing efficiency. Central to this method is the use of the axis-aligned structure that converts the general polygon packing problem to a rectangle packing problem, which is easier to achieve high packing efficiency. Given a parameterized mesh with no flipped triangles, we propose a new angle-driven deformation strategy to transform it into a set of axis-aligned charts, which can be decomposed into rectangles by the motorcycle graph algorithm. Since motorcycle graphs are not unique, we select the one balancing the trade-off between the packing efficiency and chart boundary length, while maintaining bounded packing efficiency. The axis-aligned chart often contains greater distortion than the input, so we try to reduce the distortion while bounding the packing efficiency and retaining bijection. We demonstrate the efficacy of our method on a data set containing over five thousand complex models. For all models, our method is able to produce packed atlases with bounded packing efficiency; for example, when the packing efficiency bound is set to 80%, we elongate the boundary length by an average of 78.7% and increase the distortion by an average of 0.0533%. Compared to state-of-the-art methods, our method is much faster and achieves greater packing efficiency.



Downloads


Paper, Code, Data set (16GB), Slide (coming soon), Video, Supp.



Bibtex


@article {Liu_AAAtlas_2019,
title = {Atlas Refinement with Bounded Packing Efficiency},
author = {Hao-Yu Liu and Xiao-Ming Fu and Chunyang Ye and Shuangming Chai and Ligang Liu},
journal = {ACM Transactions on Graphics (SIGGRAPH)},
volume = {38},
number = {4},
year = {2019},
}