School of Computer Science and Software Engineering

Awesome Animations

Welcome to a small sampling of the work our staff and students undertake. Some of what you will see is a result of our research, and some we have done just for fun. We hope you enjoy our small display!

Multi-hop, Wireless Flooding Simulation Creator: Rachel Cardell-Oliver Type: Java Applet (8.8 kb) Description: Flooding is another technique inspired by nature and used in sensor networks to spread information. When a node receives a message it simply broadcasts it on the radio channel to all its neighbours. Communication in sensor networks is difficult because radio signals transmitted by one node can interfere with those of another. You can see this in the flooding simulations as yellow dots (corrupted signal) amongst the blue dots (clear signal). 661 views since 28-06-2007	Synthetic dynamic hologram Creator: Paul Bourke (WASP, UWA) Type: Apple Quicktime (31.0 Mb) Description: 1500 frames that are encoded with laser onto film in order to create a synthetic dynamic hologram. The dataset is a 512x512x512 volumetric CAT scan of an unopened mummy. The animation matches the observers position, that is, as the observer movies left to right the holographic view changes from the wrapped up mummy to the unwrapped skeleton. 739 views since 18-06-2007	RockAway Creator: Michelle Le,Wilson Kwan, Luke Kim Type: External site (Remote) Description: RockAway is a simple two-player arcade style game, where inspired by frogger, two players battle it out to get to each other's side of the river. The game was developed as part of a second-year Data Structures & Algorithms Project in 2007, where we were required to build a game using the Split List (Linked-List) data structure. RockAway was written in Java and all graphics were hand drawn. 826 views since 18-06-2007
Cube graph Creator: John McCabe-Dansted Supervisor: Jamie Simpson (Curtin) Type: External site (Remote) Description: Graphs are useful in many circumstances, e.g. for representing a network of computers and links between the computers without the need for humans to spend time putting it together. In this applet, the points are connected by edges as of a cube, however the points start at random locations. The cube forms as short edges try to expand and long edges try to shrink. 652 views since 18-06-2007	Randnoswitch Graph Creator: John McCabe-Dansted Supervisor: Jamie Simpson (Curtin) Type: External site (Remote) Description: Graphs are useful in many circumstances, e.g. for representing a network of computers and links between the computers without the need for humans to spend time putting it together. In this applet each time you load the page, different points will be connected. The points begin at a random location, but you will see the diagram unfold and form an orderly structure, as the points repel but the lines hold the connected points close. 528 views since 18-06-2007	Petersen Graph Creator: John McCabe-Dansted Supervisor: Jamie Simpson (Curtin) Type: External site (Remote) Description: This graph is one of the graphs most commonly used by mathematicians as an example of various properties. This program finds ways of displaying the graph by placing the points at random locations and refining the graph by pushing points away from each other and pulling connected points closer together. The Wikipedia article describes a Petersen Graph 606 views since 18-06-2007

  Current Page count: