This is somewhat of a computational question: let me know if it is inappropriate.
I have a flat torus with sone random points marked.
I would like to compute a triangulation of said torus such that my points are the vertexes of the triangulation.
A bit of googling has not given me any results. My naive idea would be to start from the fully connected graph, and every time two edges cross, simply remove one of them. Unfortunately this looks like it's going to be quite expensive, as I have $n^2$ edges each of which can potentially intersect all of the others. I also looked into the Delauney triangulation, but I am not sure it would work on an generic torus, and moreover I have no idea on how to implement it successfully. It also seems rather overkill, since I do not need my triangulation to have any special property.
Is there a simple, greedy way to get a triangulation in non-prohibitive time?