Insertion Hull Algorithm
Description
The insertion hull algorithm is used to compute the convex hull of a set
of points by incrementally updating the hull after the insertion of each point.
- Click the mouse anywhere on the applet to input a point at that location. Define a set of points in this manner.
The hull gets created at the third point. After the input of every new point, the hull is updated incrementally.
The new hull edges are first shown in green color, then the enitre screen is refreshed and the new hull is redrawn.
You may continue input of points up to a maximum of fifty.
- Clear: Clears the screen. Click this button to start the input of a new set of points.
Computational Geometry
Java Applets Centre
R. Mukundan
Department of Computer Science
University of Canterbury
Private Bag 4800, Christchurch
New Zealand.