Upgrade to delaunator@3. about d3-delaunay HOT 8 CLOSED

    constructor(coords) {

        /* ... */

        // initialize a circular doubly-linked list that will hold an advancing convex hull
        let e = this.hull = insertNode(coords, i0);
        this._hashEdge(e);
        e.t = 0;
        e = insertNode(coords, i1, e);
        this._hashEdge(e);
        e.t = 1;
        e = insertNode(coords, i2, e);
        this._hashEdge(e);
        e.t = 2;

        /* ... */

    }

// create a new node in a doubly linked list
function insertNode(coords, i, prev) {
    const node = {
        i,
        x: coords[2 * i],
        y: coords[2 * i + 1],
        t: 0,
        prev: null,
        next: null,
        removed: false
    };

    if (!prev) {
        node.prev = node;
        node.next = node;

    } else {
        node.next = prev.next;
        node.prev = prev;
        prev.next.prev = node;
        prev.next = node;
    }
    return node;
}

    constructor(coords) {

        /* ... */

        const hullPrev = this.hullPrev = new Uint32Array(n); // edge to prev edge
        const hullNext = this.hullNext = new Uint32Array(n); // edge to next edge
        const hullTri = this.hullTri = new Uint32Array(n); // edge to adjacent triangle

        /* ... */

        // set up the seed triangle as the starting hull
        this.hullStart = i0;
        let hullSize = 3;

        hullNext[i0] = hullPrev[i2] = i1;
        hullNext[i1] = hullPrev[i0] = i2;
        hullNext[i2] = hullPrev[i1] = i0;

        hullTri[i0] = 0;
        hullTri[i1] = 1;
        hullTri[i2] = 2;

        hullHash[this._hashKey(i0x, i0y)] = i0;
        hullHash[this._hashKey(i1x, i1y)] = i1;
        hullHash[this._hashKey(i2x, i2y)] = i2;

        /* ... */

        this.hullPrev = this.hullNext = this.hullTri = null; // get rid of temporary arrays

        /* ... */

    }

// For points on the hull, index both the incoming and outgoing halfedges.
let node0, node1 = hull;
do {
  node0 = node1, node1 = node1.next;
  inedges[node1.i] = node0.t;
  outedges[node0.i] = node1.t;
} while (node1 !== hull);

for (let i = 0, h0, h1 = hull[hull.length - 1]; i < hull.length; ++i) {
  h0 = h1, h1 = hull[i];
  inedges[???] = ???;
  outedges[???] = ???;
}