2D PEBI gird generation for complex domain by refinement algorithm

Some terms related to 2-D PEBI grid are put forward, and then the current PEBI grid generation techniques are systematically analyzed and studied. Aiming at solving these shortages, an optimized examining strip subdivision algorithm for 2-D PEBI grid generation is presented. First, the initial isosceles trapezoid examining strip sets are settled according to the restriction condition, then an algorithm is designed to subdivide the examining strip to realize the speedy generation of PEBI grid. The analysis of the convergence and the time-complexity of this algorithm are also presented. An implementation example is given finally to indicate the validity of the algorithm. Supposing small angles are existed between constrained line segments, compared with the existing PEBI grid generating algorithms, this algorithm can eliminate the abnormal grid cells effectively and improve the quality of generated cells and the adaptability of the algorithm. Moreover, the number of PEBI cells outside the constrained region can be reduced and the algorithm efficiency is improved.