Description

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

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.

application/pdf

Download count: 0

Details

Contributors
Date Created
  • 2014-07-01
Resource Type
  • Text
  • Collections this item is in
    Identifier
    • Digital object identifier: 10.1145/2601097.2601164
    • Identifier Type
      International standard serial number
      Identifier Value
      0730-0301
    • Identifier Value
      1557-7368
    Note

    Citation and reuse

    Cite this item

    This is a suggested citation. Consult the appropriate style guide for specific citation guidelines.

    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

    Machine-readable links