Workshop: Visualization of Algorithms and Mathematical Ideas (0368.3500.30)

This workshop took place in the spring semester of 1999. Check out your grades!

Workshop Desciption: Many mathematical ideas, and most clearly algorithms, are most easily understood when visualized. For example tree sorting algorithms, graph algorithms, etc. Similarly certain mathematical ideas, most notably from the fields of combinatorics or geometry, have proofs that are readily visualized.
This workshop will focus on visualizing ideas, by creating some visual simulation of an algorithm or a mathematical proof.

Final submitted projects: (I ranked them according to their final grade... The first two are really wonderful)
 
Project Name By:
 
Preflow Push Adi raz, Ilana Reisenberg and Oz Shal-Bar
Turing Machine Bichuch Elena and Koplov Olga
   
Preflow Push Itamar Ankorion, Hany Noibart and Ophir Lotan
Routing IP Eran Ofek and Maor Ben-Dayan and Ran Mendelson 
NFA - DFA Adi Even-Tsur and Oren Tal
Strongly Connected Components Irit Gat and Shirley Shafrir and Yonatan Beker (Windows Explorer only!)
Plane Sweep Ran Erlich and Rafi Shachar
Huffman Codes Irina Kolesnikov and Alina Rafaelov (Windows Explorer only!)

The following are some examples:
Pythagoras' Theorem - a visualization of the famous theorem by the hot java people.
Red-Black Tree - Very very nice.
Random Walks - a project by Roy Reshef and Tali Kaufman
Geometry of the Sphere - Girard's Theorem.
Sorting Algorithms
Some Graph Algorithms

For some help getting started with java, see The Java Tutorial or this other one.

Last modified: Wed Sep 29, 1999