Geometric Minimum Spanning Trees with GeoFilterKruskal [chapter]

Samidh Chatterjee, Michael Connor, Piyush Kumar
2010 Lecture Notes in Computer Science  
Let P be a set of points in R d . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with a simple modification of Kruskal's algorithm. When P is sampled from uniform random distribution, we show that our algorithm takes one parallel sort plus a linear number of additional steps, with high probability, to compute the minimum spanning tree. Experiments show that our algorithm works better in practice for
more » ... st data distributions compared to the current state of the art [31]. Our algorithm is easy to parallelize and to our knowledge, is currently the best practical algorithm on multi-core machines for d > 2.
doi:10.1007/978-3-642-13193-6_41 fatcat:3tozu5w5e5frxluiy5vpyo36zm