• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    Computing layouts with deformable templates

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    2014.SG.Peng.Computing_Layouts_with_Deformable_Templates.pdf
    Size:
    16.40Mb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    Conference Paper
    Authors
    Peng, Chi-Han
    Yang, Yongliang
    Wonka, Peter cc
    KAUST Department
    Visual Computing Center (VCC)
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Computer Science Program
    Date
    2014-07-22
    Online Publication Date
    2014-07-22
    Print Publication Date
    2014-07-27
    Permanent link to this record
    http://hdl.handle.net/10754/575792
    
    Metadata
    Show full item record
    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.
    Citation
    Peng 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.
    Sponsors
    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.
    Publisher
    Association for Computing Machinery (ACM)
    Journal
    ACM Transactions on Graphics
    Conference/Event name
    41st International Conference and Exhibition on Computer Graphics and Interactive Techniques, ACM SIGGRAPH 2014
    DOI
    10.1145/2601097.2601164
    ae974a485f413a2113503eed53cd6c53
    10.1145/2601097.2601164
    Scopus Count
    Collections
    Conference Papers; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.