This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
Given a set S of n points in the plane and a fixed angle 0 < < , we show how to find all triangles of minimum area with angle that enclose S in O(n log n) time.