diff options
author | madmaxoft@gmail.com <madmaxoft@gmail.com@0a769ca7-a7f5-676a-18bf-c427514a06d6> | 2012-07-20 18:22:07 +0200 |
---|---|---|
committer | madmaxoft@gmail.com <madmaxoft@gmail.com@0a769ca7-a7f5-676a-18bf-c427514a06d6> | 2012-07-20 18:22:07 +0200 |
commit | 917d75edbe6d8d2ea53442da4a1dcf5c212a3d7c (patch) | |
tree | 4c2c23b60d3c6b06caa6315fdd88ce72ee6711be /source/Ravines.cpp | |
parent | Ravines: removed a debugging feature from release builds (diff) | |
download | cuberite-917d75edbe6d8d2ea53442da4a1dcf5c212a3d7c.tar cuberite-917d75edbe6d8d2ea53442da4a1dcf5c212a3d7c.tar.gz cuberite-917d75edbe6d8d2ea53442da4a1dcf5c212a3d7c.tar.bz2 cuberite-917d75edbe6d8d2ea53442da4a1dcf5c212a3d7c.tar.lz cuberite-917d75edbe6d8d2ea53442da4a1dcf5c212a3d7c.tar.xz cuberite-917d75edbe6d8d2ea53442da4a1dcf5c212a3d7c.tar.zst cuberite-917d75edbe6d8d2ea53442da4a1dcf5c212a3d7c.zip |
Diffstat (limited to 'source/Ravines.cpp')
-rw-r--r-- | source/Ravines.cpp | 43 |
1 files changed, 42 insertions, 1 deletions
diff --git a/source/Ravines.cpp b/source/Ravines.cpp index d717b324f..ca34bbc5b 100644 --- a/source/Ravines.cpp +++ b/source/Ravines.cpp @@ -316,7 +316,48 @@ void cStructGenRavines::cRavine::Smooth(void) void cStructGenRavines::cRavine::FinishLinear(void)
{
- // TODO
+ // For each segment, use Bresenham's algorithm to draw a "line" of defpoints
+ // _X 2012_07_20: I tried modifying this algorithm to produce "thick" lines (only one coord change per point)
+ // But the results were about the same as the original, so I disposed of it again - no need to use twice the count of points
+
+ cDefPoints Pts;
+ std::swap(Pts, m_Points);
+
+ m_Points.reserve(Pts.size() * 3);
+ int PrevX = Pts.front().m_BlockX;
+ int PrevZ = Pts.front().m_BlockZ;
+ for (cDefPoints::const_iterator itr = Pts.begin() + 1, end = Pts.end(); itr != end; ++itr)
+ {
+ int x1 = itr->m_BlockX;
+ int z1 = itr->m_BlockZ;
+ int dx = abs(x1 - PrevX);
+ int dz = abs(z1 - PrevZ);
+ int sx = (PrevX < x1) ? 1 : -1;
+ int sz = (PrevZ < z1) ? 1 : -1;
+ int err = dx - dz;
+ int R = itr->m_Radius;
+ int T = itr->m_Top;
+ int B = itr->m_Bottom;
+ while (true)
+ {
+ m_Points.push_back(cDefPoint(PrevX, PrevZ, R, T, B));
+ if ((PrevX == x1) && (PrevZ == z1))
+ {
+ break;
+ }
+ int e2 = 2 * err;
+ if (e2 > -dz)
+ {
+ err -= dz;
+ PrevX += sx;
+ }
+ if (e2 < dx)
+ {
+ err += dx;
+ PrevZ += sz;
+ }
+ } // while (true)
+ } // for itr
}
|