since the voronoi algorithm used inside the vb node ( (c) david - he made a pdf out of it - but he kindly took down his website some time ago so now it's lost on his computer probably) had little to do with edges and on which side of said edges things generally are modding it to do delaunay triangulations is not a solution that i personally would try to tackle.
but since i'm a generally cool guy because i enjoy coding up to a point and then start tackling more complex algorithms involving cocktails and what is the optimum O(log 2n) size a lemon slice in a ginandtonic should have, i have decided to share with you my lucky output in convincing a grasshopper to draw triangles based on a list of points. And no, it does not add to 42. so check it out here: http://dimitrie.wordpress.com/2009/04/15/delaunay-triangulation-in-grasshopper/
