Skip to content


Date: November 1, 2017

Time: 6:00PM - 7:00PM

Location: BLOC 220

Speaker: Dr. Maurice Rojas, Department of Mathematics, Texas A&M University


Title: Geometry, Sorting, and Optimizing

Abstract: We start with a geometric explanation of why sorting n numbers always takes at least n log n comparisons, up to small constant factor. We'll then see a nice algorithm by Snoeyink for how to find the rectangle with largest area (and axis parallel sides) inside of a polygon. We'll also explain why the last problem is relevant to architectural design.