**Basic Algorithm:**
- 1. Start with V
_{0}, vertex with minimum y coordinate coordinate.
- 2. While V
_{i} ≠ V_{0}, continue.
- 3. Compute angles of V
_{0}P_{i} with horizontal through extended V_{0}, for all P_{i}.
- 4. Take point with minimum angle.
- 5. At step i, we have V
_{i} on Convex Hull and then compute angles between V_{i}P_{j} and the extension of V_{i}V_{i-1}
- 6. Take minimum, which will be V
_{i +1}
- 7. Go to step 2.

**APPLETS FOR GIFT-WRAPPING:**

Gift-Wrapping

Jarvis March

## REPRESENTATION OF GIFT WRAPPING IN THE PARABOLIC DUALITY

Applet

**Basic Algorithm:**
- Start with line L
_{0} with minimum slope.

**In CH algorithm, start with point of min x coordinate.**
- Compute the coordinates for all intersections of L
_{0} and lines L_{i} for all lines in the arrangement.

**In CH algorithm, equates to computing the angle of the horizontal through chosen point, with the line from chosen point to all other points in the set of points.**
- Choose line L
_{i} that intersects L_{0} at minimum x coordinate. Call this intersection I_{j}

**In CH algorithm, equates to choosing the point whose line has minimum angle with horizontal line.
**
- While there exists a line L
_{i+1} that intersects L_{i} after I_{j}, i.e. to the right of I_{j} go to 2.

**In CH algorithm, equates to continuing algorithm till all points have been verified and the algorithm reaches the intial point.**
- The upper envelope with be made up of all the segments between the chosen intersections and the two infinate lines (min slope and max slope).