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 language | English (US) |
|---|---|
| Title of host publication | ACM Transactions on Graphics |
| Publisher | Association for Computing Machinery (ACM) |
| Pages | 1-11 |
| Number of pages | 11 |
| DOIs | |
| State | Published - Jul 22 2014 |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledgements: We thank the anonymous reviewers for their insightful comments, Yoshihiro Kobayashi and Christopher Grasso for the renderings, and Virginia Unkefer for the proofreading. This research is supported by the NSF #0643822 and the Visual Computing Center at King Abdullah University of Science and Technology.