Computing layouts with deformable templates

Chi Han Peng, Yong Liang Yang, Peter Wonka

Research output: Contribution to journalConference article

30 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.

Original languageEnglish (US)
Article number99
JournalACM Transactions on Graphics
Volume33
Issue number4
DOIs
StatePublished - Jan 1 2014
Event41st International Conference and Exhibition on Computer Graphics and Interactive Techniques, ACM SIGGRAPH 2014 - Vancouver, BC, Canada
Duration: Aug 10 2014Aug 14 2014

Keywords

  • Pattern synthesis
  • Quadrilateral meshes
  • Tiling

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Cite this