Abstract

A fast linear-time algorithm to generate non-intersecting closed random orthogonal (4-connected) digital curves of finite length imposed on a background grid is proposed in this paper. A novel timestamp-based combinatorial technique is used so that the curve grows freely without intersecting itself. The combintaorial constraints are further modified to generate 8-connected digital curves. The time complexity of the algorithm is linear in length of the curve, as decisions are made locally based on current-neighbourhood points of the digital curve. The algorithm has been implemented and tested exhaustively and an analysis of the results is also presented.

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 call

Disclaimer: 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.