Show simple item record

dc.contributor.authorTakayama, Kenshien_US
dc.contributor.authorPanozzo, Danieleen_US
dc.contributor.authorSorkine-Hornung, Olgaen_US
dc.contributor.editorThomas Funkhouser and Shi-Min Huen_US
dc.date.accessioned2015-03-03T12:42:19Z
dc.date.available2015-03-03T12:42:19Z
dc.date.issued2014en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/cgf.12443en_US
dc.description.abstractWe propose an algorithm to quadrangulate an N-sided patch with prescribed numbers of edge subdivisions at its boundary. Our algorithm is guaranteed to succeed for arbitrary valid input, which is proved using a canonical simplification of the input and a small set of topological patterns that are sufficient for supporting all possible cases. Our algorithm produces solutions with minimal number of irregular vertices by default, but it also allows the user to choose other feasible solutions by solving a set of small integer linear programs. We demonstrate the effectiveness of our algorithm by integrating it into a sketch-based quad remeshing system. A reference C++ implementation of our algorithm is provided as a supplementary material.en_US
dc.publisherThe Eurographics Association and John Wiley and Sons Ltd.en_US
dc.titlePattern-Based Quadrangulation for N-Sided Patchesen_US
dc.description.seriesinformationComputer Graphics Forumen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record