Abstract
Given a set S of n points in the plane and a fixed angle 0<ω<π, we show how to find in O(nlogn) time all triangles of minimum area with one angle ω that enclose S. We prove that in general, the solution cannot be written without cubic roots. We also prove an Ω(nlogn) lower bound for this problem in the algebraic computation tree model. If the input is a convex n-gon, our algorithm takes Θ(n) time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
