Andrew's%20Monotone%20Chain%20Convex%20Hull%20Algorithm

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.

3
(No Transcript)
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, ui1) 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.

6
(No Transcript)
7
(No Transcript)
8
(No Transcript)
9
(No Transcript)