A Completely Generalized and Algorithmic Approach to Identifying the Maximum Area Inscribing Ellipse of an Asymmetric Convex Quadrangle

It appears your Web browser is not configured to display PDF files. Download adobe Acrobat or click here to download the PDF file.

Click here to download the PDF file.


Copeland, Zachary Alexander




An algorithm is developed herein using the projective extension of the Euclidean plane which will always generate the entire one-parameter family of inscribing ellipses, and directly identify the area maximizing one of any given convex quadrangle, within a metric space. Given four bounding points, no three of which are collinear, four line equations are generated which describe a convex quadrangle. Alongside the definition of a specific polar point, these five constraints identify a pencil of inscribing line conics, which is then transformed into its point conic dual for visualisation and plotting. The pencil of point conics then has its area optimised with respect to the value of its polar point, at which juncture the maximum area inscribing ellipse may be identified from the pencil of inscribing conics.


Engineering - Mechanical




Carleton University

Thesis Degree Name: 

Master of Applied Science: 

Thesis Degree Level: 


Thesis Degree Discipline: 

Engineering, Mechanical

Parent Collection: 

Theses and Dissertations

Items in CURVE are protected by copyright, with all rights reserved, unless otherwise indicated. They are made available with permission from the author(s).