fix correct line generation algorithm and bounds calculation (#657)

* fix correct line generation algorithm and bounds calculation

- Fix closest_point_on_segment algorithm using proper dot product projection
- Correct loop bounds calculation for radius=0 lines
- Use precise integer arithmetic to avoid rounding errors
- Resolves missing blocks in vertical line structures

* fix ai hallucinations

* polishing closest_point_on_segment

* refactor: extract dot product calculation
This commit is contained in:
Eliot Byte
2025-10-23 12:29:04 +03:00
committed by GitHub
parent 6c01d57d53
commit ed9cf8800a
2 changed files with 20 additions and 10 deletions
+3 -3
View File
@@ -547,13 +547,13 @@ void WorldGenerator::generateLine(
auto b = line.b;
int minX = std::max(0, std::min(a.x-radius-cgx, b.x-radius-cgx));
int maxX = std::min(CHUNK_W, std::max(a.x+radius-cgx, b.x+radius-cgx));
int maxX = std::min(CHUNK_W, std::max(a.x+radius-cgx, b.x+radius-cgx) + 1);
int minZ = std::max(0, std::min(a.z-radius-cgz, b.z-radius-cgz));
int maxZ = std::min(CHUNK_D, std::max(a.z+radius-cgz, b.z+radius-cgz));
int maxZ = std::min(CHUNK_D, std::max(a.z+radius-cgz, b.z+radius-cgz) + 1);
int minY = std::max(0, std::min(a.y-radius, b.y-radius));
int maxY = std::min(CHUNK_H, std::max(a.y+radius, b.y+radius));
int maxY = std::min(CHUNK_H, std::max(a.y+radius, b.y+radius) + 1);
for (int y = minY; y < maxY; y++) {
for (int z = minZ; z < maxZ; z++) {