Weekly Programming Challenge #11
Back in week #4 (“Drawing Lines”), we applied ourselves to implementing the Bresenham line algorithm. One of the “hard mode” options was to implement the midpoint circle algorithm, which is kind of “Bresenham for circles”. Sadly, no one gave it a try in week #4.
It’s time to revisit it, and give it a week all for itself. Let’s draw some circles!
First, though, let’s recap week #10.
Week #10 Recap
For the 10th weekly programming challenge, we did some network programming. Three brave souls made the attempt:
- Lasse Ebert gave it a go in Elixir, and got even got some of hard mode implemented (an HTTP client with GET support). Two points to Lasse! Check it out here: https://github.com/lasseebert/jamis_challenge/tree/master/010_sock.
- Anders Engström’s Clojure implementation satisfies normal mode, and makes a stab at hard mode in the form of having the normal mode server forward requests (via HTTP POST) to Phteven.io, and return the response to the originating client. Two points to Anders! And possibly “surprise me”, too…that was unexpected (but inevitable, perhaps?) that your normal mode server would act as an HTTP client! Explore his solution here: https://github.com/metamorph/weekly-ten.
- Marcus Edvinsson used Haskell for his submission, and implemented normal mode, as well as an HTTP client with GET support. Two points for Marcus! Check it out here: https://github.com/MarEdv/wpc-week10.
- Jérôme De Cuyper implemented normal mode in C#, here: https://github.com/jdecuyper/jamisbuck-10. One point for Jérôme!
My solution this week was in Erlang, and while I had hoped to tackle an HTTP client and/or server, the week was surprisingly busy and I had to be satisfied with simply normal mode. One point for me! You can see my Erlang client and server here: https://github.com/jamis/weekly-challenges/tree/master/010-network-programming
Awesome work, everyone!
Weekly Challenge #11
The midpoint circle algorithm is an efficient way to rasterize (draw) circles. Like the Bresenham line algorithm, it works by iteratively incrementing the x and/or y coordinates for each pixel, and accumulating an error value to determine when each coordinate should be incremented. Also, it takes advantage of the radial symmetry of a circle, and is able to draw an entire circle by computing only a single octant.
It’s pretty slick. :) There are lots of published implementations, and the Wikipedia article (linked above) even includes some sample code in a few languages. Feel free to use whatever resources you need to figure this algorithm out!
For normal mode, you must write a program that meets the following criteria:
- Given an origin and a radius, draw the corresponding circle with the midpoint circle algorithm.
- Produce an image of that circle in the format of your choice. (Maybe you might reuse the image code you wrote in week #4!)
That’s it! Meeting the above criteria will give you one point.
Hard mode, now… Let’s get our game on. For each of the following you can earn another point.
- Line Styles. Allow the line to be dashed or dotted, or some combination.
- Partial arcs. Your API should accept an origin, a start point, and an end point. (Alternatively, your API may accept a radius, a start angle and an end angle.) The corresponding arc should be drawn the image.
- Ellipses. You may need to dig a bit (or experiment a bit) to adapt the midpoint circle algorithm for ellipses, but supposedly it can be done! If you’ve got time for some research, this could be a fun one to tackle.
Feel free to shoot for “surprise me” mode, too! It doesn’t have to be any harder than normal mode, but it ought to implement the challenge (either normal mode or hard mode) in some surprising, clever, or otherwise delightful way. See what you can come up with!
This challenge will run until Saturday, October 15th, at 12:00pm MDT (18:00 UTC).
The deadline for this challenge has passed, but feel free to try your hand at it anyway! Go ahead and submit a link to your solution in the comments, anytime. If you’re following along, the next week’s challenge is “Family Trees and Pedigree Charts”. See you there!