Computation of Level-Set Components From Level Lines

We present an algorithm to compute the connected components of upper or lower level sets from level lines. The running time is
$O (n + \vert \tau \vert)$
, where
$n$
is the size of the image and
$\vert \tau \vert$
is the number of level lines.