Pattern-based quadrangulation for N-sided patches

Kenshi Takayama, Daniele Panozzo, Olga Sorkine-Hornung

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)177-184
Number of pages8
JournalEurographics Symposium on Geometry Processing
Volume33
Issue number5
DOIs
StatePublished - 2014

Fingerprint

Quadrangulation
Patch
Remeshing
Integer Program
C++
Subdivision
Linear Program
Simplification
Irregular
Choose
Valid
Sufficient
Arbitrary
Demonstrate

Keywords

  • Categories and Subject Descriptors (according to ACM CCS)
  • Computational Geometry and Object Modeling-Geometric algorithms, languages, and systems
  • I.3.3 [Computer Graphics]

ASJC Scopus subject areas

  • Modeling and Simulation
  • Geometry and Topology

Cite this

Pattern-based quadrangulation for N-sided patches. / Takayama, Kenshi; Panozzo, Daniele; Sorkine-Hornung, Olga.

In: Eurographics Symposium on Geometry Processing, Vol. 33, No. 5, 2014, p. 177-184.

Research output: Contribution to journalArticle

Takayama, Kenshi ; Panozzo, Daniele ; Sorkine-Hornung, Olga. / Pattern-based quadrangulation for N-sided patches. In: Eurographics Symposium on Geometry Processing. 2014 ; Vol. 33, No. 5. pp. 177-184.
@article{05c365771c4743d6884f21c9d2a44293,
title = "Pattern-based quadrangulation for N-sided patches",
abstract = "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.",
keywords = "Categories and Subject Descriptors (according to ACM CCS), Computational Geometry and Object Modeling-Geometric algorithms, languages, and systems, I.3.3 [Computer Graphics]",
author = "Kenshi Takayama and Daniele Panozzo and Olga Sorkine-Hornung",
year = "2014",
doi = "10.1111/cgf.12443",
language = "English (US)",
volume = "33",
pages = "177--184",
journal = "Eurographics Symposium on Geometry Processing",
issn = "1727-8384",
publisher = "Eurographics Association at Graz University of Technology",
number = "5",

}

TY - JOUR

T1 - Pattern-based quadrangulation for N-sided patches

AU - Takayama, Kenshi

AU - Panozzo, Daniele

AU - Sorkine-Hornung, Olga

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Categories and Subject Descriptors (according to ACM CCS)

KW - Computational Geometry and Object Modeling-Geometric algorithms, languages, and systems

KW - I.3.3 [Computer Graphics]

UR - http://www.scopus.com/inward/record.url?scp=85014468994&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85014468994&partnerID=8YFLogxK

U2 - 10.1111/cgf.12443

DO - 10.1111/cgf.12443

M3 - Article

VL - 33

SP - 177

EP - 184

JO - Eurographics Symposium on Geometry Processing

JF - Eurographics Symposium on Geometry Processing

SN - 1727-8384

IS - 5

ER -