Razafindrazaka, Faniry H.Reitebuch, UlrichPolthier, KonradMirela Ben-Chen and Ligang Liu2015-07-062015-07-062015https://doi.org/10.1111/cgf.12710This 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.Computer Graphics [I.3.5]Computational Geometry and Object Modelling10.1111/cgf.12710219-228