Data commit

Task/Bitmap-Midpoint-circle-algorithm/Haskell/bitmap-midpoint-circle-algorithm-1.hs

@@ -0,0 +1,28 @@
+module Circle where
+
+import Data.List
+
+type Point = (Int, Int)
+
+-- Takes the center of the circle and radius, and returns the circle points
+generateCirclePoints :: Point -> Int -> [Point]
+generateCirclePoints (x0, y0) radius
+  -- Four initial points, plus the generated points
+  = (x0, y0 + radius) : (x0, y0 - radius) : (x0 + radius, y0) : (x0 - radius, y0) : points
+    where
+      -- Creates the (x, y) octet offsets, then maps them to absolute points in all octets.
+      points = concatMap generatePoints $ unfoldr step initialValues
+      generatePoints (x, y)
+        = [(xop x0 x', yop y0 y') | (x', y') <- [(x, y), (y, x)], xop <- [(+), (-)], yop <- [(+), (-)]]
+
+      -- The initial values for the loop
+      initialValues = (1 - radius, 1, (-2) * radius, 0, radius)
+
+      -- One step of the loop. The loop itself stops at Nothing.
+      step (f, ddf_x, ddf_y, x, y) | x >= y = Nothing
+                                   | otherwise = Just ((x', y'), (f', ddf_x', ddf_y', x', y'))
+                                     where
+                                       (f', ddf_y', y') | f >= 0 = (f + ddf_y' + ddf_x', ddf_y + 2, y - 1)
+                                                        | otherwise = (f + ddf_x, ddf_y, y)
+                                       ddf_x' = ddf_x + 2
+                                       x' = x + 1