title: Euclidean Minimum Spanning Tree Without Triangulation
body: <p>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? </p>