Euclidean Minimum Spanning Tree Without Triangulation

I was looking through some text about finding the EMST (Euclidean MST) using Delaunay triangulation technique, but also read somewhere that the EMST can be found through a sweep line algorithm. Since this would easier implementing, I would like to implement this rather than using a existing library. Can anyone guide me/ direct me to a link to a (possibly free) paper/source that has this algorithm explained?


From this and going by the abstracts, this and this should get you started. They both use sweepline algorithms to obtain MST's

I think the simplest technique for finding Euclidean minimum spanning tree is Delaunay trinangulation, use Bowyer-Watson algorithm. It is very easy to implement, once you have that, you can just use something like Kruskal's algorithm, using the distance as the edge weight.


 ? Updating a Minimum spanning tree when a new edge is inserted
 ? Finding a minimum spanning tree on a directed graph
 ? Use Dijkstra's to find a Minimum Spanning Tree?
 ? Create a MST with depth-first search?
 ? How is a minimum bottleneck spanning tree different from a minimum spanning tree?
 ? Update minimum spanning tree with modification of edge
 ? An algorithm to see if there are exactly two MSTs in a graph?
 ? How to find total number of minimum spanning trees in a graph?
 ? How to update element priorities in a heap for Prim's Algorithm?
 ? Implementing a randomly generated maze using Prim's Algorithm