DocumentCode :
3204741
Title :
An optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer [for rectangle read triangle]
Author :
Jeong, Chang-Sung ; Choi, Jung-Ju
Author_Institution :
Dept. of Comput. Sci., Pohang Inst. of Sci. & Technol., South Korea
fYear :
1992
fDate :
23-26 Mar 1992
Firstpage :
138
Lastpage :
141
Abstract :
The authors consider the problem of finding the smallest triangle circumscribing a convex polygon with n edges. They show that this can be done in O(√n) time by efficient data partition schemes and proper set mapping and comparison operations using a so called √n-decomposition technique. Since the nontrivial operation on MCC requires Ω(√n), the time complexity is optimal within a constant time factor
Keywords :
computational complexity; computational geometry; multiprocessor interconnection networks; parallel algorithms; comparison operations; convex polygon; data partition; mesh-connected computer; optimal parallel algorithm; set mapping; smallest triangle; time complexity; Clocks; Collision avoidance; Computer science; Parallel algorithms; Partitioning algorithms; Robots; Time factors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1992. Proceedings., Sixth International
Conference_Location :
Beverly Hills, CA
Print_ISBN :
0-8186-2672-0
Type :
conf
DOI :
10.1109/IPPS.1992.223058
Filename :
223058
Link To Document :
بازگشت