title: Confused with Voronoi diagram algorithm (Fortune's sweepline)
body: <p>I am implementing Voronoi diagram to find out the nearest location in a map visually. Right now I want to do this using integer coordinates (x,y) only in a canvas.</p>
  
  <p>Problem is- I am really confused about this algorithm. I read the Computational Geometry book, few more theory on Fortune's algorithm. And I am really confused now. It seems very complex to me when I am going for coding.</p>
  
  <p>Please advice me very simple implementation of voronoi diagram (with given coordinates). Please advice me simple java or python or scheme code preferably without- hash, multi-threading, Delaunay Traingulation, fancy colors etc. </p>
  
  <p>Isn't it possible to implement Voronoi diagram using Fortune's algorithm without multithreading or hash map?</p>