• Calendar

March 28, Wednesday
12:00 – 14:00

Algovision is a collection of Java applets for visualization of algorithms. The applets were originally written for an undergraduate course on algorithms at Charles University by the speaker. They cover elementary stuff (tree data structures, heaps, sorting), basic graph algorithms (shortest path, spanning tree, flows), arithmetic algorithms (carry look-ahead addition, FFT), geometric algorithms (convex hull and Voronoi diagram in 2D), string matching (Rabin-Karp, Knuth-Morris-Pratt, Aho-Corasick), and geometric background of the simplex algorithm of LP

Unlike usual algorithm animation applets, Algovision aims to present visual tools to explain the underlying algorithmic idea and invariants that are basis for termination, correctness and complexity analysis; animation and visualization is often used to explain corresponding proofs. Moreover, many Algovision applets present visual tools to show other features of the algorithm in question, e.g., data structures used to implement the algorithm, applications, etc.