The F# Journal just published an article about computer graphics:
"Daniel Sleator wrote a great little OCaml program implementing the Delaunay triangulation algorithm in quadratic time. This is an important algorithm in many fields including computer graphics and numerical methods. This article walks through the process of translating this program first into working F#, then into idiomatic F# and finally into efficient F#..."
To read this article and more, subscribe to The F# Journal today!
Does reference counting really use less memory than tracing garbage collection? Mathematica vs Swift vs OCaml vs F# on .NET and Mono - Our previous post caused some controversy by questioning the validity of some commonly-held beliefs. Specifically, the beliefs that reference counting (RC)...
3 weeks ago