Max. Mass of the Euclidean spanning tree

Question

The maximum spanning tree can be found by executing the kruskal algorithm (simply by changing the edge function and first examining the edges of the maximum weight). I am interested in finding the maximum weight of a Euclidean spanning tree. Is there a better algorithm (better than worst-case execution time) than kruskal to find such a spanning tree?

Answer 1

Monma et al. Allow this in O(n log h) time and O(n) space, where n is the number of points and h is the size of the convex hull.

The algorithm (clause 10 of the article) is quite simple, therefore it should be accessible even without understanding the full proof.