Computing layouts with deformable templates

Chi-Han Peng, Yongliang Yang, Peter Wonka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

37 Scopus citations

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. Copyright © ACM.
Original languageEnglish (US)
Title of host publicationACM Transactions on Graphics
PublisherAssociation for Computing Machinery (ACM)
Pages1-11
Number of pages11
DOIs
StatePublished - Jul 22 2014

Cite this