Sifting of a Potent Convex Hull Algorithm for Scattered Point Set Using Parallel Programming

Geographic Information Systems (GIS) has been prominently working for the designed to sculpt the world. With the growth and data and increasing sophistication of analysis and processing techniques the traditional sequential methods of performing GIS processing on desktop computers is insufficient. This paper is based on analysis and the performance of 3D convex hull algorithm for the three flavors of parallel architecture considering spatial scatter point data using parallel programming. As GIS use huge set of scatter data for processing and development of many product, a Convex Hull of planner scattered point set will useful in the area of planning and grafting the satellite image in GIS. Analysis is based on the parallel algorithm on OpenMP, MPI and Hybrid of HPC (High Performance Computing) architecture also improvement strategy for the huge data point available for computing such as GIS spatial data with respective OpenMP, MPI and Hybrid is stated.