Adobe Photoshop, Gimp and many other graphic programs have a tool called Curves. You have several "knots" and while you move them, it computes a curve between. I was always wondered, how is this curve computed.
I have made a little tool. Here you can specify some binary relation over a finite set. Then you can generate a closure of it.
This text was created as a credit work at subject Algorithms nad data structures II, MFF UK. It contains an implementation in C++ (at the end) and ActionScript 3.0 (in previous posts).
This work has been created as my credit exam at subject Nonprocedural programming at MFF UK. It is about solving sliding puzzle with Prolog programming language.
In this article we will see how to implement some basic geometry functions in 2D space. We will wirte line segment intersection and circumcircle.
This post will be dedicated to drawing graphs in an aesthetically pleasing way. We will use physics "spring" algorithm, and create real-time simulation.
Today we will take a look at recursive fractal drawing in ActionScript 3. We will draw a Sierpinski Triangle.
This is lightweight (19 kB) matirx class written in C#, that includes basic matrix operations.