Keyword : farthest neighbors problem of polygons


Designing Efficient Parallel Algorithms with Multi-Level Divide-and-Conquer
Wei CHEN Koichi WADA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/05/01
Vol. E84-A  No. 5 ; pp. 1201-1208
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
design of parallel algorithmmulti-level divide-and-conquerconvex hull problem of discsupper envelope problem of segmentsfarthest neighbors problem of polygons
 Summary | Full Text:PDF