### Download Presentation

Andrews Monotone Chain Convex Hull Algorithm

**An Image/Link below is provided (as is) to download presentation**
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

#### Presentation Transcript

**1. **Andrew's Monotone Chain Convex Hull Algorithm

**2. **Andrew's Monotone Chain Scan A left-to-right variant of Graham's scan
Discovered by Andrew in 1979
Using a linear lexigraphic sort of the point set by the x- and y-coordinates
This may be an advantage if this order is already known for a set which is often the case.

**4. **The Chain Method Definition :
A chain C = ( u1, … , up ) is a planar straight-line graph with vertex set { u1, … , up } and edge set { (ui, ui+1) : i = 1, …, p-1 }

**5. **The Monotone Chain Definition :
A chain C = ( u1, …, up ) is said to be monotone with respect to a straight line L if a line orthogonal to L intersects C in exactly one point.