@inproceedings{7eca117861cb47c282d170f60581290a,

title = "Optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer",

abstract = "In this paper, we consider the problem of finding the smallest triangle circumscribing a convex polygon with n edges. We shall show that this can be done in O(√n) time by the efficient data partition schemes and the proper set mapping and comparison operations using what so called √n-decomposition technique. Since the nontrivial operation on MCC requires Ω(√n), the time complexity is optimal within constant time factor.",

author = "Jeong, {Chang Sung} and Choi, {Jung Ju}",

year = "1992",

language = "English",

isbn = "0818626720",

series = "Proceedings of the International Conference on Parallel Processing",

publisher = "Publ by IEEE",

pages = "138--141",

booktitle = "Proceedings of the International Conference on Parallel Processing",

note = "Proceedings of the 6th International Parallel Processing Symposium ; Conference date: 23-03-1992 Through 26-03-1992",

}