Carleton University
A Completely Generalized and Algorithmic Approach to Identifying the Maximum Area Inscribing Ellipse of an Asymmetric Convex Quadrangle
Abstract
dc:description.abstractAn 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Applied Science (M.App.Sc.)
- Level thesis:degree_level
- Master's
- Discipline thesis:degree_discipline
- Engineering, Mechanical
- Grantor dc:publisher
- Carleton University
- Year dc:date.issued
- 2017
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Copeland, Zachary Alexander
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- Copyright © 2017 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.
- Language dc:language.iso
- en