Now a day's many algorithms are invented / being inventing to find the solution for Euclidean Minimum Spanning Tree (EMST) problem, as its applicability is increasing in much wide range of fields containing spatial / spatio - temporal data viz. astronomy which consists of millions of spatial data. To solve this problem, we are presenting a technique by adopting the dual tree algorithm for finding efficient EMST and experimented on a variety of real time and synthetic datasets. This paper presents the observed experimental observations and the efficiency of the dual tree framework,in the context of kd-tree and ball-tree on spatial datasets of different dimensions. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.
CITATION STYLE
Munaga, H., & Jarugumalli, V. (2012). Performance evaluation: Ball-tree and KD-tree in the context of MST. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 62 LNICST, pp. 225–228). https://doi.org/10.1007/978-3-642-32573-1_38
Mendeley helps you to discover research relevant for your work.