http://en.wikipedia.org/wiki/Delaunay_triangulation https://en.wikipedia.org/wiki/Voronoi_diagram observe as this plots triangles without overlapping them, then draws a somewhat-accurate voronoi dual of the result I noticed this algorithm while trying out @Finlay_Cool's video source thingything and before you know it I was researching how this is done. how it works: 1. take a set of points as input 2. for each three-group of points, check that they are colinear, and if not, find the position and radius of the circumscribed circle. 3. count the number of points within the circumcircle. if there are no other points than the three points being checked, create a triangle with those points.
