Computing layouts with deformable templates


Peng, C.-H., Yang, Y.-L. and Wonka, P., 2014. Computing layouts with deformable templates. ACM Transactions on Graphics, 33 (4), 99:1-99:11.

Related documents:

PDF (layoutTemplates_sig14) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (16MB) | Preview


    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.


    Item Type Articles
    CreatorsPeng, C.-H., Yang, Y.-L. and Wonka, P.
    Uncontrolled Keywordspattern synthesis, quadrilateral meshes, tiling
    DepartmentsFaculty of Science > Computer Science
    ID Code44038


    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...