Abstract
A non-parametric sequential technique for polygonal approximation of digital curves is proposed. The procedure looks for the longest possible line segments by maximising an objective function which comprises of the length of the line segment and the integral square error along the line segment. The vertices of the polygon are those points where this function attains a local maximum. Though the procedure is sequential and one pass, neither does it round off sharp turnings nor does it dislocate the vertices near the other turnings.
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.
