AUTOMATIC TRIANGULATION OF ARBITRARY PLANAR DOMAIN
Li Shi · Journal of Tianjin University Science and Technology · 2000
WT5”BZ]Firstly,a new method is proposed for generating interior nodal points within an arbitrary planar domain.The newly generated points are exactly within the domain with smooth points densities and a good quality of the final mesh.Secondly,an improved Delaunay triangulation method,which is more general and robust,is also proposed for solving the automatic triangulation problem within an arbitrary planar domain (non convex,multi connected and concyclic points).It has three advantages:1)without additional lines,2) no need to change the original point set,and 3) easy to program.Finally,numerical precision is taken into account.The programs based on those above mentioned methods have been successfully used in many engineering applications. [WT5”HZ]