Computation of level lines of 4-/8-connectedness ?
A topdown algorithm is introduced to compute 4-/8-connected level line trees. The running time is linear to the input image size and the total level line length. The algorithm is an extension of an algorithm previously developed by the author. Mathematical techniques are developed to analyze 4-/8-connected level lines.
level line topdown algorithm level line tree jordan boundary level set image representation square grid connectedness