Let me present you 3D Tool, web-based model viewer with a simple renderer I made during this summer. It has basic functionality and can deal with several basic 3D formats. 3DTool.ivank.net.
I needed really fast Gaussian blur for one of my projects. After hours of struggling and browsing the internet, I finally found the best solution.
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 always wondered, how is this curve computed.
There are many "smart" algorithms in 2D graphics and Floyd-Steinberg error diffusion is one of them. Attached demo demonstrates a dithering on webcam output (or Bucks Bunny video, when webcam is not available).
I have made a "SM Tool" during the last summer. It is a program, which allows you to work and play with Finite-state machines. It was my credit work on Advanced programming for .NET.
Today's post will be about Quadtrees. I have coded a little visualization, which may help you understand this data structure.
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 article can be a guide for solving some problems with Prolog. If you know it's syntax, maybe after reading this you will get an idea, how to use this language effectively.
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).
Today I woud like to show you a remake of my previous flash app, which I rewrote into HTML5. It is the force-based graph algorithm form my previous article.
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.
After last 2 posts about geometry, I decided to explain, how to make a game like Untangle (solving planar graph by moving vertices).
In this article we will see how to implement some basic geometry functions in 2D space. We will wirte line segment intersection and circumcircle.
In today's article I will introduce you my own small library for generating Voroni diagram in ActionScript 3. I used Fortune's algorithm, which is probably the fastest algorithm for solving Voronoi diagram.
Today we will learn how to implement the Aho-Corasick algorithm. It is used for finding occurences of words in text and it is faster than other common algorithms. Code will be in ActionScript 3, but implementation in C, C++, C# or Java will be very similar.
This post will be dedicated to drawing graphs in an aesthetically pleasing way. We will use physics "spring" algorithm, and create real-time simulation.
In this post, we will implement the Trie data structure in ActionScript 3. Then we will draw it to get a nice picture of this data structure.
Today we will take a look at recursive fractal drawing in ActionScript 3. We will draw a Sierpinski Triangle.
In this article we implement a binary search tree in ActionScript 3. We will create a class and add some basic methods. At the end we create an algorithm to draw it.
This is lightweight (19 kB) matirx class written in C#, that includes basic matrix operations.
I have created an easy Matrix calculator in Pascal. The application is controlled via console and you control it with few easy commands, as Store, List, Add, Multiply etc.