KAUST DepartmentVisual Computing Center (VCC)
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computer Science Program
MetadataShow full item record
AbstractIn 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.
CitationPeng C-H, Yang Y-L, Wonka P (2014) Computing layouts with deformable templates. ACM Transactions on Graphics 33: 1–11. Available: http://dx.doi.org/10.1145/2601097.2601164.
SponsorsWe 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.
JournalACM Transactions on Graphics
Conference/Event name41st International Conference and Exhibition on Computer Graphics and Interactive Techniques, ACM SIGGRAPH 2014