对于带有特征的网格给出了一种将它们划分为一系列矩形片的算法.首先基于给定的一些特征,在网格上建立一个优化的三角剖分,在得到一系列的三角片或多边形片后,利用固定角保留的方法进行预处理;然后对这些三角片及多边形片之间的连接关系进行分类;最后针对不同的连接关系,定义相应的规则来提取矩形片.
An algorithm to partition a mesh with possible sharp features such as corner, dart, crease edge and cusp into quadrilateral domains is presented. The procedure starts from an optimal triangulation based on the network of sharp features, and a method named ideal angle reservation is provided to pre+treat the triangulated domains. Later, all triangles are converted into quadrilaterals under some predefined rules for the classified given types of interconnection among triangular patc'hes. Some examples are given to demonstrate the algorithm.