How does this code for delaunay triangulation work?
问题 I have this Java code that with a set of Point in input return a set of graph's edge that represent a Delaunay triangulation. I would like to know what strategy was used to do this, if exist, the name of algorithm used. In this code GraphEdge contains two awt Point and represent an edge in the triangulation, GraphPoint extends Awt Point, and the edges of final triangulation are returned in a TreeSet object. My purpose is to understand how this method works: public TreeSet getEdges(int n, int[