|
计算机科学 2008
A New Parallel Algorithm for Finding Convex Hull Based on Maximum Pitch and Distance of the Dynamical Base Line
|
Abstract:
In this paper, the advantages of both the parallel algorithm thinking for finding convex hull based on maximum pitch of the dynamical base line and the serial algorithm thinking for finding convex hull based on maximum distance of the dynamical base line are integrated, and the later is extended in multi-domains and is modified in parallel, further a more efficient new parallel algorithm to find a convex hull based on maximum pitch and distance of the dynamical base line is given. The general characters of ...