Abstract
A symbolic algorithm is described to detect dominant points of a simple closed boundary. First, a concavity code is constructed from the Freeman chain code to classify the degree of concavity or convexity of boundary coordinates. Then, dominant points are extracted by discarding shallow curvature sequences of the concavity code, by appealing to a technique called error budgeting.
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.
