int i1 = newNode(); queryList[i1].nodeType = SeidelNode.TYPE_Y; int i2 = newNode(); queryList[i1].rightChild = i2; queryList[i2].nodeType = SeidelNode.TYPE_SINK; queryList[i2].parent = i1; int i3 = newNode(); queryList[i1].leftChild = i3; queryList[i3].nodeType = SeidelNode.TYPE_Y; int i4 = newNode(); queryList[i3].leftChild = i4; queryList[i4].nodeType = SeidelNode.TYPE_SINK; queryList[i4].parent = i3; int i5 = newNode(); queryList[i3].rightChild = i5; queryList[i5].nodeType = SeidelNode.TYPE_X; int i6 = newNode(); queryList[i5].leftChild = i6; queryList[i6].nodeType = SeidelNode.TYPE_SINK; queryList[i6].parent = i5; int i7 = newNode(); queryList[i5].rightChild = i7; queryList[i7].nodeType = SeidelNode.TYPE_SINK;
int i1 = newNode(); // Upper trapezoid sink int i2 = newNode(); // Lower trapezoid sink int sk = trapezoidList[tu].sink; int i1 = newNode(); // Upper trapezoid sink int i2 = newNode(); // Lower trapezoid sink int sk = trapezoidList[tu].sink; int i1 = newNode(); // left trapezoid sink int i2 = newNode(); // right trapezoid sink