Skip to main content
Fig. 6 | EURASIP Journal on Wireless Communications and Networking

Fig. 6

From: SKDStream: a dynamic clustering algorithm on time-decaying data stream

Fig. 6

The instance of updation after inserting new MBH in 2D space. A Upadation when the new MBH is included in only one node in SKDTree, B Upadation when the new MBH intersects only one node in SKDTree, C Upadation when the new MBH intersects more than one node in SKDTree, D Upadation when the new MBH separates from all the nodes in SKDTree. Note: The black rectangle represents the range of SKDTree root. The blue rectangle represents the cluster cell to be inserted. The orange solid line represents the original split hyperplane. The black dashed line represents the updated range. The red dashed line represents the new range

Back to article page