I know i am not the first to do this, but i have done this all on my own. This method was converted from the 508 client.
What this method does is fix the lines that show up in transparent models on the 317 client.
I wont show you where to put this method so youll have to figure that out yourself.
Code:
public static void method375(int[] ai, int i, int l, int i1, int j1, int k1) {
int j;
int k;
int l1 = 0;
if (aBoolean1462) {
if (i1 > DrawingArea.centerX)
i1 = DrawingArea.centerX;
if (l < 0) {
j1 -= l * l1;
l = 0;
}
}
if (l < i1) {
i += l;
j1 += l1 * l;
if (aBoolean1464) {
k = i1 - l >> 2;
if (k > 0)
l1 = (k1 - j1) * anIntArray1468[k] >> 15;
else
l1 = 0;
if (anInt1465 == 0) {
if (k > 0) {
do {
j = anIntArray1482[j1 >> 8];
j1 += l1;
ai[i++] = j;
ai[i++] = j;
ai[i++] = j;
ai[i++] = j;
} while (--k > 0);
}
k = i1 - l & 0x3;
if (k > 0) {
j = anIntArray1482[j1 >> 8];
do
ai[i++] = j;
while (--k > 0);
}
} else {
int j2 = anInt1465;
int l2 = 256 - anInt1465;
if (k > 0) {
do {
j = anIntArray1482[j1 >> 8];
j1 += l1;
j = (((j & 0xff00ff) * l2 >> 8 & 0xff00ff) + ((j & 0xff00)
* l2 >> 8 & 0xff00));
int h = ai[i];
ai[i++] = (j
+ ((h & 0xff00ff) * j2 >> 8 & 0xff00ff) + ((h & 0xff00)
* j2 >> 8 & 0xff00));
h = ai[i];
ai[i++] = (j
+ ((h & 0xff00ff) * j2 >> 8 & 0xff00ff) + ((h & 0xff00)
* j2 >> 8 & 0xff00));
h = ai[i];
ai[i++] = (j
+ ((h & 0xff00ff) * j2 >> 8 & 0xff00ff) + ((h & 0xff00)
* j2 >> 8 & 0xff00));
h = ai[i];
ai[i++] = (j
+ ((h & 0xff00ff) * j2 >> 8 & 0xff00ff) + ((h & 0xff00)
* j2 >> 8 & 0xff00));
} while (--k > 0);
}
k = i1 - l & 0x3;
if (k > 0) {
j = anIntArray1482[j1 >> 8];
j = (((j & 0xff00ff) * l2 >> 8 & 0xff00ff) + ((j & 0xff00)
* l2 >> 8 & 0xff00));
do {
int i_61_ = ai[i];
ai[i++] = (j
+ ((i_61_ & 0xff00ff) * j2 >> 8 & 0xff00ff) + ((i_61_ & 0xff00)
* j2 >> 8 & 0xff00));
} while (--k > 0);
}
}
} else {
int i2 = (k1 - j1) / (i1 - l);
k = i1 - l;
if (anInt1465 == 0) {
do {
ai[i++] = anIntArray1482[j1 >> 8];
j1 += i2;
} while (--k > 0);
} else {
int i_62_ = anInt1465;
int i_63_ = 256 - anInt1465;
do {
j = anIntArray1482[j1 >> 8];
j1 += i2;
j = (((j & 0xff00ff) * i_63_ >> 8 & 0xff00ff) + ((j & 0xff00)
* i_63_ >> 8 & 0xff00));
int i_64_ = ai[i];
ai[i++] = (j
+ ((i_64_ & 0xff00ff) * i_62_ >> 8 & 0xff00ff) + ((i_64_ & 0xff00)
* i_62_ >> 8 & 0xff00));
} while (--k > 0);
}
}
}
}
Enjoy!
your result should be this: