1 files changed, 37 insertions, 7 deletions

diff --git a/src/VoronoiMap.h b/src/VoronoiMap.h
index 84cf206e9..dfb11e9ce 100644
--- a/src/VoronoiMap.h
+++ b/src/VoronoiMap.h
@@ -18,19 +18,40 @@
 class cVoronoiMap
 {
 public:
-	cVoronoiMap(int a_Seed, int a_CellSize = 128);
+	cVoronoiMap(int a_Seed, int a_CellSize = 128, int a_JitterSize = 128);
 	
-	/// Sets the cell size used for generating the Voronoi seeds
+	/** Sets both the cell size and jitter size used for generating the Voronoi seeds. */
 	void SetCellSize(int a_CellSize);
+
+	/** Sets the jitter size. Clamps it to current cell size. */
+	void SetJitterSize(int a_JitterSize);
+
+	/** Sets the offset that is added to each odd row of cells.
+	This offset makes the voronoi cells align to a non-grid.
+	Clamps the value to [-m_CellSize, +m_CellSize]. */
+	void SetOddRowOffset(int a_OddRowOffset);
 	
-	/// Returns the value in the cell into which the specified point lies
+	/** Returns the value in the cell into which the specified point lies. */
 	int GetValueAt(int a_X, int a_Y);
 	
-	/// Returns the value in the cell into which the specified point lies, and the distance to the nearest Voronoi seed
+	/** Returns the value in the cell into which the specified point lies,
+	and the distance to the nearest Voronoi seed. */
 	int GetValueAt(int a_X, int a_Y, int & a_MinDistance);
 	
-	/// Returns the value in the cell into which the specified point lies, and the distances to the 2 nearest Voronoi seeds. Uses a cache
-	int GetValueAt(int a_X, int a_Y, int & a_MinDistance1, int & a_MinDistance2);
+	/** Returns the value in the cell into which the specified point lies,
+	and the distances to the 2 nearest Voronoi seeds. Uses a cache. */
+	int GetValueAt(
+		int a_X, int a_Y,                            // Coords to query
+		int & a_NearestSeedX, int & a_NearestSeedY,  // Coords of the closest cell's seed
+		int & a_MinDist2                             // Distance to the second closest cell's seed
+	);
+
+	/** Finds the nearest and second nearest seeds, returns their coords. */
+	void FindNearestSeeds(
+		int a_X, int a_Y,
+		int & a_NearestSeedX, int & a_NearestSeedY,
+		int & a_SecondNearestSeedX, int & a_SecondNearestSeedY
+	);
 
 protected:
 	/// The noise used for generating Voronoi seeds
@@ -38,8 +59,17 @@ protected:
 	cNoise m_Noise2;
 	cNoise m_Noise3;
 	
-	/// Size of the Voronoi cells (avg X/Y distance between the seeds)
+	/** Size of the Voronoi cells (avg X/Y distance between the seeds). Expected to be at least 2. */
 	int m_CellSize;
+
+	/** The amount that the cell seeds may be offset from the grid.
+	Expected to be at least 1 and less than m_CellSize. */
+	int m_JitterSize;
+
+	/** The constant amount that the cell seeds of every odd row will be offset from the grid.
+	This allows us to have non-rectangular grids.
+	Expected to be between -m_CellSize and +m_CellSize. */
+	int m_OddRowOffset;
 	
 	/** The X coordinate of the currently cached cell neighborhood */
 	int m_CurrentCellX;