Show simple item record

dc.contributor.authorZhou, Jiaranen_US
dc.contributor.authorTu, Changheen_US
dc.contributor.authorZorin, Denisen_US
dc.contributor.authorCampen, Marcelen_US
dc.contributor.editorPanozzo, Daniele and Assarsson, Ulfen_US
dc.description.abstractThe problem of seamless parametrization of surfaces is of interest in the context of structured quadrilateral mesh generation and spline-based surface approximation. It has been tackled by a variety of approaches, commonly relying on continuous numerical optimization to ultimately obtain suitable parameter domains. We present a general combinatorial seamless parameter domain construction, free from the potential numerical issues inherent to continuous optimization techniques in practice. The domains are constructed as abstract polygonal complexes which can be embedded in a discrete planar grid space, as unions of unit squares. We ensure that the domain structure matches any prescribed parametrization singularities (cones) and satisfies seamlessness conditions. Surfaces of arbitrary genus are supported. Once a domain suitable for a given surface is constructed, a seamless and locally injective parametrization over this domain can be obtained using existing planar disk mapping techniques, making recourse to Tutte's classical embedding theorem.en_US
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.rightsAttribution 4.0 International License
dc.subjectComputing methodologies
dc.subjectComputer graphics
dc.subjectMesh models
dc.subjectMesh geometry models
dc.subjectShape modeling
dc.titleCombinatorial Construction of Seamless Parameter Domainsen_US
dc.description.seriesinformationComputer Graphics Forum
dc.description.sectionheadersGeometry Processing

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution 4.0 International License
Except where otherwise noted, this item's license is described as Attribution 4.0 International License