目的 高质量四边形网格生成是计算机辅助设计、等几何分析与图形学领域中一个富有挑战性的重要问题。针对这一问题，提出一种基于边界简化与多目标优化的高质量四边形网格生成新框架。方法 首先针对亏格非零的平面区域，提出一种将多连通区域转化为单连通区域的方法，可生成高质量的插入边界；其次，提出"可简化角度"和"可简化面积比率"两个阈值概念，从顶点夹角和顶点三角形面积入手，将给定的多边形边界简化为粗糙多边形；然后对边界简化得到的粗糙多边形进行子域分解，并确定每个子域内的网格顶点连接信息；最后提出四边形网格的均匀性和正交性度量目标函数，并通过多目标非线性优化技术确定网格内部顶点的几何位置。结果 在同样的离散边界下，本文方法与现有方法所生成的四边网格相比，所生成的四边网格顶点和单元总数目较少，网格单元质量基本类似，计算时间成本大致相同，但奇异点数目可减少70% 80%，衡量网格单元质量的比例雅克比值等相关指标均有所提高。结论 本文所提出的四边形网格生成方法能够有效减少网格中的奇异点数目，并可生成具有良好光滑性、均匀性和正交性的高质量四边形网格，非常适用于工程分析和动画仿真。

Objective The rapid development of advanced and intelligent manufacturing has caused the seamless data integration of geometric design and simulation to be a key problem in computer-aided design (CAD) and computer-aided engineering (CAE). In the product simulation and analysis stage for the classical finite element analysis method and the emerging iso-geometric analysis method, the meshing quality of computational domain is an important factor that affects the accuracy and computing efficiency of simulation results. Mesh generation has become an important research direction in the field of CAE. Research on high-quality quadrilateral meshing has particularly attracted significant attention because it is an important and challenging problem in the fields of CAD, iso-geometric analysis, and computer graphics. The main quad mesh generation methods currently used in commercial software include triangular mesh conversion, paving, template, and medial axis methods. The triangular mesh conversion method is usually limited by the vertex distribution of the triangular mesh and the connectivity among the vertices, and it hardly generates a high-quality quadrilateral mesh with few singular vertices. The quadrilateral mesh generation method based on medial axis decomposition is sensitive to boundary changes, which is insufficiently robust and is difficult to be implemented automatically. For complex planar regions, the paving method can generate high-quality quadrilateral meshes; however, the elements paving in different directions may lead to self-intersections, in which the validity of the generated meshes cannot be guaranteed. For complex boundaries, the paving method generates many singular vertices. To overcome the above limitations of the quadrilateral meshing methods for planar domain, we propose a new framework for high-quality quadrilateral mesh generation by using boundary simplification and multi-objective optimization technique, considering the urgent requirement for data seamless integration in CAD/CAE. Method First, a new method is proposed to transfer a multiply-connected domain to a simply-connected domain with a high-quality and uniform-boundary insertion. Second, boundary simplification is used in decreasing the number of initial boundary vertex to reduce computing costs. Two threshold concepts, namely simplification angle and simplification area ratio, are proposed to simplify the given boundary into a rough polygon from the vertex angle and the area of vertex triangle. Third, subdomain decomposition method is performed on the rough polygon obtained by boundary simplification, and high-quality domain decomposition can be obtained by uniform vertex insertion. After n-sided domain decomposition is obtained, the optimal quadrilateral mesh is selected from the existing catalog of meshes by high-quality patterns. The vertex connectivity information for each subdomain is determined by meshing rules with few singularities. The main idea of this method is to use integer-programming techniques, such that the resulting topological connectivity template has the smallest number of singularities. Finally, the geometric position of interior mesh vertices is obtained by multi-objective optimization technique, an extended Laplacian operator is proposed for quad mesh, and a uniformity objective function is derived from the concept of variance in statistics and probability theory to obtain a quadrilateral mesh with a uniform element size; that is, if the variance of the quadrilateral element area in the generated grid is zero, then the mesh has a uniform element size. Furthermore, a unified formula for the objective function related to the orthogonality around the vertex with arbitrary valence is proposed. The geometric position of the vertex in the quad mesh is determined by the multi-objective nonlinear optimization technique to minimize the objective functions for the smoothness, uniformity and orthogonality measurements, which are solved by a quasi-Newton nonlinear optimization algorithm. Result From the same discrete boundary, the quadrilateral mesh generated by our method has smaller numbers of mesh vertices and elements than those of previous methods. The number of extraordinary vertices can also be reduced by 70%~80%. The metrics for the evaluation of mesh quality, such as scaled Jacobian, are also improved. The corresponding computing time for each method in terms of computational efficiency is listed. In terms of algorithm complexity, the proposed method is similar to three classical quadrilateral mesh generation methods, and the time complexity of the proposed method is related to the number of vertices for a given discrete boundary. Conclusion Compared with previous approaches, the proposed method can generate high-quality quad meshes with fewer extraordinary vertices and higher mesh qualities, such as smoothness, uniformity, and orthogonality, as exhibited by the presented mesh generation examples.