Computer Science ›› 2008, Vol. 35 ›› Issue (4): 244-247.
Previous Articles Next Articles
Online:
Published:
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 li
Key words: Isomorphic, COW, Convex hull, Parallel algorithm, Pitch of the dynamical base line, Distance of the dynamical base line
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2008/V35/I4/244
Cited