To reconstruct 3D shape from the planar cross-sections (or slices) \(\lbrace C_k\rbrace _{k=1}^{n_{C}}\) , we utilize its up to three orthographic projections: \(I_{i}, i \in \lbrace 1, 2, 3\rbrace \) . In each step algorithm chooses one of the projections and selects a region in it to separate from the initial shape. At the end 3D shape is simply union of all the individual parts, \(P = \bigcup \limits _{i=1}^{K} S_{i}\) , \(K\)  is number of all parts. Each part to be selected approximated using slices in this region. In the optimal case, each the individual part consists of only one connected component without any branching. To achieve this, the first step is to detect the corner points in the projection images. Detecting corner points in the image is well explored topic [1]}, [2]}, [3]}, [4]}, [5]}, [6]}, [7]}. The corner points detected using corner response function (\(C\) ) for all pixels in the image region. This is computed by calculating the following:
\(M = \sum _{x,y} w(x,y)\begin{bmatrix}I_{x}^2 & I_{x} I_{y}\\I_{x} I_{y} & I_{y}^2\end{bmatrix}\\ C = |M| - k(trace\ M)^2\) 
