It is somewhat abandoned.
Using the code from the preceding three exercises, implement Graham’s scan algorithm for the convex hull of a set of 2D points. You can find good description of what a convex hull. is, and how the Graham scan algorithm should work, on Wikipedia
Force categories list not to use category descritption use this:
I am reading “Joy Of Clojure”. It seems like a good book, but it keeps telling me about these problems I have which I don’t percieve as problems.
Let’s say that you won the lottery. That would be great, wouldn’t it?
This comes in handy sometimes.
NakedObjectsFramework antlr aop attribute-based-caching bitcoin blog bluetooth books brain_gym c# ci clojure comedy cte data draft emacs ergodox essay euler f# faq field-level-authorization fitness git good-judgement-project gym hakyll haskell haskell-is-hard humor ideas keyboard lets-split merging nix nixos nparsec parsec parser parser-combinator paul-graham planck postgres postsharp prediction presentation release row-level-authorization scala slick tags thinkpad tuples update windows wordpress wssf