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 combinat...
详细信息
ISBN:
(纸本)9783319149745;9783319149738
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.
暂无评论