A New Algorithm of Planar Triangulation
Xinyuan Zhang · Journal of Chongqing Institute of Technology · 2006
This article presents a new algorithm about planar triangulation that firstly uses R.L.Graham scanning method to get the convex hull of all the points,at the same time deletes the points of this new convex hull from the original point muster,and then again seeks the convex hull of residual point muster.This article uses R.L.Graham scanning method to get a series of convex hulls and divides the original area into many ringed mini-extents,then,uses the algorithm presented in this article to triangulate the area between every two neighborly convex hulls so as to realize the triangulation of the whole original area.