Abstract
We want to find an inpolygon of shortest circumference in a given convex polygon with m vertices. Focke [2] evolves the polygon under successive reflection, lays a line corresponding to an inpolygon through all concave vertices of this “channel” and shortens the line by a descent method with complexity O(m 3) to an optimum. We determine a first active vertex of the channel with complexity O(m) lay a straight line through this vertex and lengthen the line by a trivial method with complexity O(m 2) to a feasible line (optimum).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
