Perfect Matching Quad Layouts for Manifold Meshes

Simple item page
dc.contributor.authorRazafindrazaka, Faniry H.en_US
dc.contributor.authorReitebuch, Ulrichen_US
dc.contributor.authorPolthier, Konraden_US
dc.contributor.editorMirela Ben-Chen and Ligang Liuen_US
dc.date.accessioned2015-07-06T05:01:13Z
dc.date.available2015-07-06T05:01:13Z
dc.date.issued2015en_US
dc.description.abstractThis paper introduces a new approach to automatically generate pure quadrilateral patch layouts on manifold meshes. The algorithm is based on a careful construction of a singularity graph of a given input frame field or a given periodic global parameterization. A pure quadrilateral patch layout is then derived as a constrained minimum weight perfect matching of that graph. The resulting layout is optimal relative to a balance between coarseness and geometric feature alignment. We formulate the problem of finding pure quadrilateral patch layouts as a global optimization problem related to a well-known concept in graph theory. The main advantage of the new method is its simplicity and its computation speed. Patch layouts generated by the present algorithm are high quality and are very competitive compared to current state of the art.en_US
dc.description.number5en_US
dc.description.sectionheadersQuads and Polygonsen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume34en_US
dc.identifier.doi10.1111/cgf.12710en_US
dc.identifier.pages219-228en_US
dc.identifier.urihttps://doi.org/10.1111/cgf.12710en_US
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectComputer Graphics [I.3.5]en_US
dc.subjectComputational Geometry and Object Modellingen_US
dc.titlePerfect Matching Quad Layouts for Manifold Meshesen_US
Files
Collections
34-Issue 5
SGP15: Eurographics Symposium on Geometry Processing (CGF 34-5)