My new WebGL games
I was playing with JavaScript and decided to create my own small framework for 2D games, based on WebGL. I have alredy made 2 small games on top of it.
6 CommentsI was playing with JavaScript and decided to create my own small framework for 2D games, based on WebGL. I have alredy made 2 small games on top of it.
6 CommentsI 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.
No CommentsToday's post will be about Quadtrees. I have coded a little visualization, which may help you understand this data structure.
No CommentsI have made a little tool. Here you can specify some binary relation over a finite set. Then you can generate a closure of it.
No CommentsThis 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.
No CommentsThis 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).
4 CommentsToday 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.
4 CommentsI always wanted to try programming in JavaScript, so I decided to rewrite my implementation of Fortune's algorithm from C++ and ActionScript 3 into JavaScript.
2 CommentsThis 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.
No CommentsAfter last 2 posts about geometry, I decided to explain, how to make a game like Untangle (solving planar graph by moving vertices).
5 CommentsIn this article we will see how to implement some basic geometry functions in 2D space. We will wirte line segment intersection and circumcircle.
No CommentsIn 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.
5 CommentsToday we will learn how to implement the Aho-Corasick algorithm. It is used for finding occurences of some words in text and it is faster than other common algorithms. Implementation in C, C++, C# or Java will be very similar.
11 CommentsThis post will be dedicated to drawing graphs in an aesthetically pleasing way. We will use physics "spring" algorithm, and create real-time simulation.
24 CommentsIn 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.
13 CommentsThis is lightweight (19 kB) matirx class written in C#, that includes basic matrix operations.
4 Comments