Fortune’s algorithm and implementation
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).
Posts Tagged ‘ActionScript 3’
Basic geometry functions
In this article we will see how to implement some basic geometry functions in 2D space. We will wirte line segment intersection and circumcircle.
Voronoi diagram in AS3
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.
Force-based 3D graph drawing in AS3
I decided to extend my last graph drawing algorithm - I added a "z" coordinate (for position, forces etc.). I used Away3DLite libraries for drawing a graph.
Aho-Corasick – implementation and animation
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.
Force-based graph drawing in AS3
This post will be dedicated to drawing graphs in an aesthetically pleasing way. We will use physics "spring" algorithm, and create real-time simulation.
Trie implementation in AS3
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.
Sierpinski Triangle in AS3
Today we will take a look at recursive fractal drawing in ActionScript 3. We will draw a Sierpinski Triangle.
Binary Search Tree in AS3
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.