• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • 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 LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Connectivity editing for quad-dominant meshes

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Peng, Chihan
    Wonka, Peter cc
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Computer Science Program
    Visual Computing Center (VCC)
    Date
    2013-08-19
    Online Publication Date
    2013-08-19
    Print Publication Date
    2013-08
    Permanent link to this record
    http://hdl.handle.net/10754/562889
    
    Metadata
    Show full item record
    Abstract
    We propose a connectivity editing framework for quad-dominant meshes. In our framework, the user can edit the mesh connectivity to control the location, type, and number of irregular vertices (with more or fewer than four neighbors) and irregular faces (non-quads). We provide a theoretical analysis of the problem, discuss what edits are possible and impossible, and describe how to implement an editing framework that realizes all possible editing operations. In the results, we show example edits and illustrate the advantages and disadvantages of different strategies for quad-dominant mesh design. © 2013 The Author(s) Computer Graphics Forum © 2013 The Eurographics Association and John Wiley & Sons Ltd.
    Citation
    Peng, C.-H., & Wonka, P. (2013). Connectivity Editing for Quad-Dominant Meshes. Computer Graphics Forum, 32(5), 43–52. doi:10.1111/cgf.12171
    Sponsors
    We thank Helmut Pottmann for the proof of the discrete Gauss Bonnet theorem, Xiang Sun and Caigui Jiang for helping with the geometric optimizations, Alexander Schiftner, Yu-Kun Lai, Martin Marinov, and Dong-ming Yan for providing datasets, Yoshihiro Kobayashi and Christopher Grasso for the renderings, Virginia Unkefer for the proofreading, and the anonymous reviewers for their insightful comments. This work was supported by the National Science Foundation and KAUST.
    Publisher
    Wiley
    Journal
    Computer Graphics Forum
    DOI
    10.1111/cgf.12171
    ae974a485f413a2113503eed53cd6c53
    10.1111/cgf.12171
    Scopus Count
    Collections
    Articles; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    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.