Computing layouts with deformable templates

C.H. Peng, Y.L. Yang, P. Wonka
ACM Transactions on Graphics, volume 33, issue 4, article 99, (2014)

Computing layouts with deformable templates

Keywords

Tiling, Pattern synthesis, Quadrilateral meshes

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.

Code

DOI: 10.1145/2601097.2601164

Sources

Website PDF

See all publications 2014