Pattern-Based Quadrangulation for N-Sided Patches

We propose an algorithm to quadrangulate an N‐sided patch (2 ≤ N ≤ 6) 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...

Full description

Saved in:
Bibliographic Details
Published in:Computer graphics forum Vol. 33; no. 5; pp. 177 - 184
Main Authors: Takayama, Kenshi, Panozzo, Daniele, Sorkine-Hornung, Olga
Format: Journal Article
Language:English
Published: Oxford Blackwell Publishing Ltd 01.08.2014
Subjects:
ISSN:0167-7055, 1467-8659
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose an algorithm to quadrangulate an N‐sided patch (2 ≤ N ≤ 6) 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.
Bibliography:ArticleID:CGF12443
Supporting Information
ark:/67375/WNG-PRTL5R74-D
istex:D406AEC682C8D31F873FBB845EB49253397D95B8
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.12443