By Topic

An optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer [for rectangle read triangle]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chang-Sung Jeong ; Dept. of Comput. Sci., Pohang Inst. of Sci. & Technol., South Korea ; Choi, J.-J.

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

Published in:

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Date of Conference:

23-26 Mar 1992