Abstract
In this article, we present an efficient algorithm to determine the convex hull of a finite planar set using the idea of the Method of Orienting Curves (introduced by Phu in Zur Lösung einer regulären Aufgabenklasse der optimalen Steuerung in Großen mittels Orientierungskurven, Optimization, 18 (1987), pp. 65–81, for solving optimal control problems with state constraints). The convex hull is determined by parts of orienting lines and a final line. Two advantages of this algorithm over some variations of Graham's convex hull algorithm are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.