wisplite/distant-horizons-sharded
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

when there are too many gaps, remove the bottom one of the smallest size first.

Browse Source
This commit is contained in:
cola98765
2021-10-30 15:52:16 +02:00
parent 73ddbd66b5
commit bb16cfa4fe
1 changed files with 1 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/main/java/com/seibel/lod/util/DataPointUtil.java
+1 -20
View File
@@ -423,25 +423,6 @@ public class DataPointUtil
return dataPoint;
}
//we cut the 1 block gaps
/*int j;
for (i = 0; i < count - 1; i++)
{
if (heightAndDepth[i * 2 + 1] - heightAndDepth[(i + 1) * 2] == 1)
{
heightAndDepth[i * 2 + 1] = heightAndDepth[(i + 1) * 2 + 1];
for (j = i + 1; j < count - 1; j++)
{
heightAndDepth[j * 2] = heightAndDepth[(j + 1) * 2];
heightAndDepth[j * 2 + 1] = heightAndDepth[(j + 1) * 2 + 1];
}
count--;
i--;
}
}*/
//we limit the vertical portion to maxVerticalData
int j = 0;
while (count > maxVerticalData)
@@ -449,7 +430,7 @@ public class DataPointUtil
ii = worldHeight;
for (i = 0; i < count - 1; i++)
{
if (heightAndDepth[i * 2 + 1] - heightAndDepth[(i + 1) * 2] < ii)
if (heightAndDepth[i * 2 + 1] - heightAndDepth[(i + 1) * 2] <= ii)
{
ii = heightAndDepth[i * 2 + 1] - heightAndDepth[(i + 1) * 2];
j = i;