A novel algorithm is presented which employs a projective extension of the Euclidean plane to identify the entire one-parameter family of inscribing ellipses, subject to a set of four linear constraints in the plane of the pencil, and directly identifies the area maximising one given any convex quadrangle. In the algorithm, four specified bounding vertices, no three collinear, determine four line equations describing a convex quadrangle. Considering the quadrangle edges as four polar lines enveloping an ellipse, together with one of the corresponding pole points on the ellipse, we define five bounding constraints on the second order equation revealing a description of the pencil of inscribing line conics. This envelope of line conics is then transformed to its point conic dual for visualisation and area maximisation. The ellipse area is optimised with respect to the single pole point and the maximum area inscribing ellipse emerges.

Additional Metadata
Keywords convex quadrangle, point and line ellipses, pole point and polar line
Persistent URL dx.doi.org/10.1007/978-3-030-20131-9_24
Series Mechanisms and Machine Science
Citation
Hayes, M.J.D, Copeland, Z.A. (Zachary A.), Zsombor-Murray, P.J. (Paul J.), & Gfrerrer, A. (Anton). (2019). Largest Area Ellipse Inscribing an Arbitrary Convex Quadrangle. In Mechanisms and Machine Science. doi:10.1007/978-3-030-20131-9_24