Abstract
We present a linear-time algorithm for recognizing digitized circular arcs, by a reduction to linear programming in fixed dimensions. This generalizes the known results for both digital line segments and complete circles. Moreover, our idea is flexible enough to admit further extensions, such as recognizing disconnected subsets of digital circles and elliptical 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.
