Computer Science ›› 2008, Vol. 35 ›› Issue (4): 244-247.

Previous Articles     Next Articles

  

  • Online:2018-11-16 Published:2018-11-16

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

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!