Gift Wrapping Algorithm
Description
The gift-wrapping algorithm is used to compute the convex
hull of a set of points by starting from the lowest point, and tracing the boundary in the anti-clockwise sense,
using the minimum angle criterion.
- Click the mouse anywhere on the applet to input a point at that location. Define a set of points in this manner.
- Compute Hull: After specifying a set of points, click this button to start the algorithm.
- 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.