Computing layouts with deformable templates
Chi-Han Peng, Yong-Liang Yang, Peter Wonka
In ACM Transactions on Graphics, 33(4), July 2014.
Abstract: In this paper, we tackle the problem of tiling a domain with a set of deformable templates. A valid solution to this problem completely covers the domain with templates such that the templates do not overlap. We generalize existing specialized solutions and formulate a general layout problem by modeling important constraints and admissible template deformations. Our main idea is to break the layout algorithm into two steps: a discrete step to lay out the approximate template positions and a continuous step to refine the template shapes. Our approach is suitable for a large class of applications, including floorplans, urban layouts, and arts and design.
@article{Peng:2014:CLW,
author = {Chi-Han Peng and Yong-Liang Yang and Peter Wonka},
title = {Computing layouts with deformable templates},
journal = {ACM Transactions on Graphics},
volume = {33},
number = {4},
pages = {99:1--99:11},
month = jul,
year = {2014},
}
Return to the search page.
graphbib: Powered by "bibsql" and "SQLite3."