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:	Algorithms Analysis and systems Boundaries Categories and Subject Descriptors (according to ACM CCS) Computer graphics Computer programming I.3.3 [Computer Graphics]: Computational Geometry and Object Modeling-Geometric algorithms I.3.3 [Computer Graphics]: Computational Geometry and Object Modeling—Geometric algorithms, languages, and systems Integers languages Mathematical models Simplification Studies Subdivisions Topological manifolds Topology
ISSN:	0167-7055, 1467-8659
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!