Parallel Algorithm for Finding the Smallest Enclosing Rectangle on SIMD Machines

May 11th, 2015
Studypool Tutor
Price: $10 USD

Tutor description

In this thesis, we present a parallel algorithm for nding the smallest enclosing rectangle which encloses a set S of n points in the plane. This problem arises frequently in industrial elds such as packing and optimal layout problems. Using the property that the smallest enclosing rectangle of a convex hull for S has the same area as that of n points in S , we rst compute a convex hull for S and then nd the smallest enclosing rectangle directly from that convex hull.

Word Count: 7112
Showing Page: 1/48
Recommendation ReportParallel Algorithm for Finding the Smallest Enclosing Rectangle on SIMD MachinesJung-Ju Choi Department of Computer Science POSTECH P.O. Box 125, Pohang 790-600, KOREA.AbstractIn this thesis, we present a parallel algorithm for nding the smallest enclosing rectangle which encloses a set S of n points in the plane. This problem arises frequently in industrial elds such as packing and optimal layout problems. Using the property that the smallest enclosing rectangle of a convex hull for S has the same area as that of n points in S , we rst compute a convex hull for S and then nd the smallest enclosing rectangle directly from that convex hull. Therefore, our algorithm can be executed very fast with small constant factor. The proposed algorithm can be generally implemented on SIMD (Single Instruction stream and Multiple Data stream)-type parallel computers such as MCC (Mesh Connected Computer) and CCC (Cube Connected Computer). Our parallel algorithm can be executed with the time complexity p O( n) and O(log n) on MCC and CCC respectively. 2Contents1 Introduction 2 Models of Parallel Computations2.1 Parallel Architecture : : : : 2.1.1 MCC : : : : : : : : : 2.1.2 CCC : : : : : : : : : 2.2 Problem Solving Technique : 2.3 Basic Parallel Operations : :1: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 8 9

Review from student

Studypool Student
" all I can say is wow very fast work, great work thanks "
Ask your homework questions. Receive quality answers!

Type your question here (or upload an image)

1822 tutors are online

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors