Abstract
In this work a new method for obtaining optimal polygonal approximations is presented. The new method is iterative and uses a improved version of the method proposed by Salotti. In the first iteration, the Perez method is used with a random starting point for obtaining a suboptimal polygonal approximation. In the rest of iterations, the improved Salotti method is used. The best error value obtained in the previous iterations is used as a value of pruning for the next iterations. The farthest point from the starting point, in the obtained polygonal approximation, is used as starting point in the next iteration. Tests have shown that in a small number of iterations, global optimal polygonal approximation is obtained. The results show that the computation time is significantly reduced, compared with existing methods.
Sign-in/Register to access full text options 
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.
