# Parallel Algorithm for Finding the Smallest Enclosing Rectangle on SIMD Machines

**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.

## Review from student

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