Fig. 8

A line graph showing the distance values of the nodes on the dendrogram:We choose the width to cut the dendrogram. For a given width, we get a corresponding count of rectangles (i.e., the entire cluster is partitioned by the selected number of rectangular boxes). Here, we show the optimal cutting path, for Rectangles Count = 3.