Abstract
This paper concerns the digital circle recognition problem, especially in the form of the circular separation problem. General fundamentals, based on classical tools, as well as algorithmic details, are given (the latter by providing pseudo-code for major steps of the algorithm). After recalling the geometrical meaning of the separating circle problem, we present an incremental algorithm to segment a discrete curve into digital arcs.
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.
