public int[] getLinked(int i) {
return mesh.get(i).links;
}
public Delaunay(float[][] points) {
if (points.length < 1) {
edges = new float[0][4];
mesh = new LinkedArray(0);
links = new int[0][2];
linkCount = 0;
return;
}
// build points array for qhull
double qPoints[] = new double[points.length * 3 + 9];
for (int i = 0; i < points.length; i++) {
qPoints[i * 3] = points[i][0];
qPoints[i * 3 + 1] = points[i][1];
qPoints[i * 3 + 2] =
-(points[i][0] * points[i][0]
+ points[i][1] * points[i][1]); // standard half-squared eucledian distance
}
// 1
qPoints[qPoints.length - 9] = -2000;
qPoints[qPoints.length - 8] = 0;
qPoints[qPoints.length - 7] = -4000000;
// 2
qPoints[qPoints.length - 6] = 2000;
qPoints[qPoints.length - 5] = 2000;
qPoints[qPoints.length - 4] = -8000000;
// 3
qPoints[qPoints.length - 3] = 2000;
qPoints[qPoints.length - 2] = -2000;
qPoints[qPoints.length - 1] = -8000000;
// prepare quickhull
QuickHull3D quickHull = new QuickHull3D(qPoints);
int[][] faces = quickHull.getFaces(QuickHull3D.POINT_RELATIVE + QuickHull3D.CLOCKWISE);
// turn faces into links
mesh = new LinkedArray(points.length + 3);
links = new int[1][2];
linkCount = 0;
for (int i = 0; i < faces.length; i++) {
for (int j = 0; j < faces[i].length; j++) {
int p = faces[i][j];
int q = faces[i][(j + 1) % faces[i].length];
if (p < points.length && q < points.length && !mesh.linked(p, q)) {
mesh.link(p, q);
if (linkCount == links.length) {
int[][] tmplinks = new int[links.length * 2][2];
System.arraycopy(links, 0, tmplinks, 0, links.length);
links = tmplinks;
}
links[linkCount][0] = p;
links[linkCount][1] = q;
linkCount++;
}
}
}
// turn links into edges
edges = new float[linkCount][4];
for (int i = 0; i < linkCount; i++) {
edges[i][0] = points[links[i][0]][0];
edges[i][1] = points[links[i][0]][1];
edges[i][2] = points[links[i][1]][0];
edges[i][3] = points[links[i][1]][1];
}
}