Computing layouts with deformable templates

Chi-Han Peng; Yong-Liang Yang; Peter Wonka

doi:10.1145/2601097.2601164

Computing layouts with deformable templates

Chi-Han Peng, Yong-Liang Yang, Peter Wonka

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

67 Citations (SciVal)

662 Downloads (Pure)

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 language	English
Article number	99
Pages (from-to)	1-11
Number of pages	11
Journal	ACM Transactions on Graphics
Volume	33
Issue number	4
Early online date	31 Jul 2014
DOIs	https://doi.org/10.1145/2601097.2601164
Publication status	Published - 31 Jul 2014

Keywords

pattern synthesis, quadrilateral meshes, tiling

Access to Document

10.1145/2601097.2601164

layoutTemplates_sig14.PDF
© ACM, 2014. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Graphics, VOL 33, ISS 4, July 2014 http://doi.acm.org/10.1145/2601097.2601164
Accepted author manuscript, 16.4 MB

Yongliang Yang
- Y.Yang2bath.acuk
Person: Research & Teaching

Cite this

@article{662948f05b04418bbd138ac1b2e754d9,

title = "Computing layouts with deformable templates",

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.",

keywords = "pattern synthesis, quadrilateral meshes, tiling",

author = "Chi-Han Peng and Yong-Liang Yang and Peter Wonka",

year = "2014",

month = jul,

day = "31",

doi = "10.1145/2601097.2601164",

language = "English",

volume = "33",

pages = "1--11",

journal = "ACM Transactions on Graphics",

issn = "0730-0301",

publisher = "Association for Computing Machinery",

number = "4",

}

TY - JOUR

T1 - Computing layouts with deformable templates

AU - Peng, Chi-Han

AU - Yang, Yong-Liang

AU - Wonka, Peter

PY - 2014/7/31

Y1 - 2014/7/31

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

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

KW - pattern synthesis, quadrilateral meshes, tiling

U2 - 10.1145/2601097.2601164

DO - 10.1145/2601097.2601164

M3 - Article

SN - 0730-0301

VL - 33

SP - 1

EP - 11

JO - ACM Transactions on Graphics

JF - ACM Transactions on Graphics

IS - 4

M1 - 99

ER -

Computing layouts with deformable templates

Abstract

Keywords

Access to Document

Fingerprint

Profiles

Yongliang Yang

Cite this