Given a set S of n > 2 points in the plane (in general position), we show how to compute in O(n2) time, a triangle T with maximum (or minimum) area enclosing S among all enclosing triangles with fixed perimeter P and one fixed angle ω. We show that a similar approach can be used to compute a triangle T with maximum (or minimum) perimeter enclosing S among all enclosing triangles with fixed area A and one fixed angle ω.

Additional Metadata
Conference 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
Citation
Bose, P, & De Carufel, J.-L. (Jean-Lou). (2011). Isoperimetric triangular enclosure with a fixed angle. Presented at the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011.