注册
登录
调度引擎
>>
Convex-Hull
>>
返回
项目作者:
satwik-m
项目描述 :
Parallelization using openmp, MPI, Hybrid
高级语言:
C++
项目主页:
项目地址:
git://github.com/satwik-m/Convex-Hull.git
创建时间:
2018-12-17T15:42:59Z
项目社区:
https://github.com/satwik-m/Convex-Hull
开源协议:
下载
Convex-Hull
A convex hull is a convex polygon that encloses all the points in it
Quick Hull Algorithm is used to find the convex hull of points in 2-D space in this project
The Basic idea is to improve runtime of the algorithm using K-means clustering technique
The points are divided into clusters and their respective convex hulls are found and combined
One more time the algorithm is applied to obtain the final Convex Hull
The parallelization is done in 3 ways using the following:
OpenMP
MPI
Hybrid ( OpenMP + MPI )
IEEE paper_1647685960564.pdf