A Linear-time Algorithm for the Generation of Random Digital Curves

  • Authors:
  • Partha Bhowmick;Oishee Pal;Reinhard Klette

  • Affiliations:
  • -;-;-

  • Venue:
  • PSIVT '10 Proceedings of the 2010 Fourth Pacific-Rim Symposium on Image and Video Technology
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose an algorithm to generate random digital curves of finite length, generating points of a digital path $\rho$ on the fly. Path $\rho$ never intersects or touches itself, and hence becomes simple and irreducible. This is ensured by detecting every possible trap formed by the previously generated part of $\rho$, which, if entered into, cannot be exited without touching or intersecting $\rho$. The algorithm is completely free of any backtracking and its time complexity is linear in the length of $\rho$. Implemented and tested exhaustively, it shows that it produces results as specified by the user.