In this paper, a new method of topological cleanup for quadrilateral mesh is presented. The method first selects a patch of mesh around an irregular node. It then seeks the best connection of the selected patch according to its irregular valence using a new topological operation： small polygon reconnection （SPR）. By replacing the original patch with an optimal one that has less irregular valence, mesh quality can be improved. Three applications based on the proposed approach are enumerated： （1） improving the quality of a quadrilateral mesh, （2） converting a triangular mesh to a quadrilateral one, and （3） adapting a triangle generator to a quadrilateral one. The presented method is highly effective in all three applications.
Incremental algorithm is one of the most popular procedures for constructing Delaunay triangulations （DTs）. However, the point insertion sequence has a great impact on the amount of work needed for the construction of DTs. It affects the time for both point location and structure update, and hence the overall computational time of the triangulation algorithm. In this paper, a simple deterministic insertion sequence is proposed based on the breadth-first-search on a Kd-tree with some minor modifications for better performance. Using parent nodes as search-hints, the proposed insertion sequence proves to be faster and more stable than the Hilbert curve order and biased randomized insertion order （BRIO）, especially for non-uniform point distributions over a wide range of benchmark examples.
