Recommendation

Not Recommended

Link

http://www.eecs.wsu.edu/~holder/courses/cse2320/lectures/applets/convexhull/ch.html

Delivery Method

Java Applet

License

Unlicensed Sourcecode

Language

English

Author

Jeff So

Institution

University of Texas at Arlington

Project

StandAlone

RelationshipToProject

StandAlone

Works

Yes

Description

Animates two algorithms for the Convex Hull problem: a brute-force algorithm and Quick Hull. In both cases the user selects the input (a set of points) graphically and starts the animation at one of three speeds. The visualization contains the points, edges in the convex hull and edges that are being considered (the point or edge currently under consideration is highlighted in red).

Evaluation

According to the web page, the "purpose is to compare the speed and techniques of each algorithm in finding the hull", not to aid in understanding how the algorithm works. Therefore, it is hardly surprising that there are no explanations of what the algorithm is doing, and even on the slowest speed, the Quick Hull algorithm runs by in a blur after the initial sweeps through the full set of points. The stated purpose also explains why the animation mostly visualizes the time-consuming scanning through points one at a time looking for the left- and rightmost points or the point farthest from chosen chord, and does not visualize the partitioning of the set of points at all. The applet does have sound, but as it consists solely of a "plop" for every event, it is of little use.

ActivityLevel

GoodFor

Screenshots

Videos

References

HowToUse

First Visited

2007-09-26

Last Visited

2007-09-26

Last Updated

Topic

ComputationalGeometry

Community

Edit

You may edit this entry if you have an account.