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

Institute of Industrial Intelligence and Green Energy

Research output: Contribution to journal › Conference article › peer-review

70 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 language	English
Article number	99
Journal	ACM Transactions on Graphics
Volume	33
Issue number	4
DOIs	https://doi.org/10.1145/2601097.2601164
State	Published - 2014
Event	41st International Conference and Exhibition on Computer Graphics and Interactive Techniques, ACM SIGGRAPH 2014 - Vancouver, BC, Canada Duration: 10 Aug 2014 → 14 Aug 2014

Keywords

Pattern synthesis
Quadrilateral meshes
Tiling

Access to Document

10.1145/2601097.2601164

Cite this

@article{0346e0b9b4d74aec87916f9328a7b2e5,

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 = "Peng, {Chi Han} and Yang, {Yong Liang} and Peter Wonka",

year = "2014",

doi = "10.1145/2601097.2601164",

language = "English",

volume = "33",

journal = "ACM Transactions on Graphics",

issn = "0734-2071",

publisher = "Association for Computing Machinery (ACM)",

number = "4",

note = "41st International Conference and Exhibition on Computer Graphics and Interactive Techniques, ACM SIGGRAPH 2014 ; Conference date: 10-08-2014 Through 14-08-2014",

}

TY - JOUR

T1 - Computing layouts with deformable templates

AU - Peng, Chi Han

AU - Yang, Yong Liang

AU - Wonka, Peter

PY - 2014

Y1 - 2014

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

KW - Quadrilateral meshes

KW - Tiling

UR - http://www.scopus.com/inward/record.url?scp=84905717940&partnerID=8YFLogxK

U2 - 10.1145/2601097.2601164

DO - 10.1145/2601097.2601164

M3 - Conference article

AN - SCOPUS:84905717940

SN - 0734-2071

VL - 33

JO - ACM Transactions on Graphics

JF - ACM Transactions on Graphics

IS - 4

M1 - 99

T2 - 41st International Conference and Exhibition on Computer Graphics and Interactive Techniques, ACM SIGGRAPH 2014

Y2 - 10 August 2014 through 14 August 2014

ER -

Computing layouts with deformable templates

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this