diff --git a/procedural-placement/Assets/PointGeneration.cs b/procedural-placement/Assets/PointGeneration.cs
index 57b92f2..b76fce3 100644
--- a/procedural-placement/Assets/PointGeneration.cs
+++ b/procedural-placement/Assets/PointGeneration.cs
@@ -86,9 +86,8 @@ public static class PointGeneration {
 
     public static List<Vector2> improved_poisson_sampling(int numPoints, Vector2 regionSize, float radius,
         int attempts = 30) {
-        float cellSize = radius / Mathf.Sqrt(2);
+        float cellSize = radius / Mathf.Sqrt(2); // Size of each cell in the region
 
-        // A grid for
         int[,] grid = new int[Mathf.CeilToInt(regionSize.x / cellSize), Mathf.CeilToInt(regionSize.y / cellSize)];
         List<Vector2> points = new List<Vector2>();
         List<Vector2> spawnPoints = new List<Vector2>();
@@ -100,19 +99,19 @@ public static class PointGeneration {
             bool candidateAccepted = false;
 
             float seed = Random.value;
-            float epsilon = 0.000000001f;
-
+            float epsilon = 0.0000001f;
+            
+            // Try to place a new point near
             for (int i = 0; i < attempts; i++) {
+                // Old poisson sampling math
                 // float angle = Random.value * Mathf.PI * 2; // Random radian angle
                 // Vector2 dir = new Vector2(Mathf.Sin(angle), Mathf.Cos(angle));
                 // Vector2 candidate = spawnCenter + dir * Random.Range(radius, radius * 2);
+                
                 float theta = 2 * Mathf.PI * (seed + i / attempts);
                 Vector2 candidate = spawnCenter + (radius + epsilon) * new Vector2(Mathf.Sin(theta), Mathf.Cos(theta));
-                // Vector2 candidate = new Vector2(
-                //     spawnCenter.x + r * Mathf.Sin(theta),
-                //     spawnCenter.y + r * Mathf.Cos(theta)
-                // );
-
+                
+                // Check that the point is valid, make the corresponding changes
                 if (poisson_valid(candidate, regionSize, cellSize, points, grid, radius)) {
                     points.Add(candidate);
                     spawnPoints.Add(candidate);
@@ -122,6 +121,7 @@ public static class PointGeneration {
                 }
             }
 
+            // If no suitable new point could be found, remove it from the running
             if (!candidateAccepted) {
                 spawnPoints.RemoveAt(spawnIndex);
             }
diff --git a/procedural-placement/Assets/PointRendering.cs b/procedural-placement/Assets/PointRendering.cs
index 9076a42..4d8c5eb 100644
--- a/procedural-placement/Assets/PointRendering.cs
+++ b/procedural-placement/Assets/PointRendering.cs
@@ -24,6 +24,8 @@ public class PointRendering : MonoBehaviour {
     public float radius = 3;
     [Tooltip("The number of attempts the sampling algorithm will give to place another point")]
     public int retryAttempts = 30;
+    [Tooltip("Draw a wireframe sphere showing the radius between each sphere.")]
+    public bool drawSphere = false;
 
     // Store the previous value, only useful for the inspector
     private SamplingTypes _samplingMethod;
@@ -72,7 +74,12 @@ public class PointRendering : MonoBehaviour {
         // Render spheres at every point
         if (_points == null) return;
         var pos = transform.position;
-        foreach (var point in _points)
-            Gizmos.DrawSphere(new Vector3(point.x + pos.x - (regionSize.x / 2), point.y + pos.y - (regionSize.y / 2)), sphereSize);
+        foreach (var point in _points) {
+            var center = new Vector3(point.x + pos.x - (regionSize.x / 2), point.y + pos.y - (regionSize.y / 2));
+            Gizmos.DrawSphere(center,
+                sphereSize);
+            if(drawSphere)
+                Gizmos.DrawWireSphere(center, radius / 2);
+        }
     }
 }
\ No newline at end of file