I'm trying to develop a program, where in a 2D space, a random set of points generates a graph using Delaunay triangulations.
For this part there is a great amount of algorithms which can do so.
The second part I want to implement consists in performing a relaxation in the points, i.e., allowing them to shift in the 2D space in order to be equally distant from each others.
I know that for Voronoi diagrams (the dual graph of Delaunay triangulations), Lloyd's algorithm can perform that task, but I can't seem to find any type of algorithm independent from this diagram structure (which I wouldn't really need to compute except for this relaxation step).
Any hints on type of algorithm I need?
Thanks in advance!