Full metadata
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.
- Peng, Chi-Han (Author)
- Yang, Yong-Liang (Author)
- Wonka, Peter (Author)
- Ira A. Fulton Schools of Engineering (Contributor)
Peng, Chi-Han, Yang, Yong-Liang, & Wonka, Peter (2014). Computing Layouts with Deformable Templates. ACM TRANSACTIONS ON GRAPHICS, 33(4),Article 99. http://dx.doi.org/10.1145/2601097.2601164
- 2014-12-05 02:17:09
- 2021-10-26 04:08:57
- 2 years 6 months ago