I am concerned with the triangulation of the points in the plane : Given n points in the plane, join them by nonintersecting straight line segments so that every region internal to the convex hull is a triangle.
So far I have met many kinds of triang...
I am concerned with the triangulation of the points in the plane : Given n points in the plane, join them by nonintersecting straight line segments so that every region internal to the convex hull is a triangle.
So far I have met many kinds of triangulation algorithms in serial. But I am trying to speed up these algorithms at any way. Hence I used parallel computing model for this purpose.
I presented optimal parallel algorithm for triangulation of the points. These algorithm run in O(log n) time with O(n) processors on the CREW PRAM model.