Robert's project : In class, we proved that given any two polygons
of the same area, one can be
decomposed into a finite number of pieces, which you can rearrange in a
different pattern to form the other. Robert programmed the proof and
animated it before your amazed eyes. (SGI, C++)
Dustin's project : Dustin
implemented the very intricate Fortune's sweep algorithm which
constructs the Voronoi diagram of a set of point sites. (Linux, C)
Zaijin's project : Following discussion of visibility graphs and
shortest path motion planning in a 2d environment of obstacles, Zaijin
implemented an applet to do just that. In addition, when placing and
deforming the obstacles, collision detection is performed to ensure that
the input to the algorithm is valid. (Java applet)
Mao Chen's project : intrigued by polyhedral surfaces and 3D
visualization, Mao implemented the marching cubes algorithm, and
demonstrates it on example CT scan (of molecules and chemical compounds)
found at the UNC's server. (SGI, C)
