Not Frequent

0/8

# Convex Hull

Author: Benjamin Qi

### Prerequisites

Smallest convex polygon containing a set of points on a grid.

Focus Problem – read through this problem before continuing!

## With Graham Scan

### Solution

### This section is not complete.

Any help would be appreciated! Just submit a Pull Request on Github.

## With Monotone Chain

- CPH 30.3 (brief)
- Wikipedia
- My Implementation

### Solution

### This section is not complete.

Any help would be appreciated! Just submit a Pull Request on Github.

## Rotating Caliphers

Focus Problem – read through this problem before continuing!

### Solution

Resources | |||
---|---|---|---|

CF |

### This section is not complete.

Any help would be appreciated! Just submit a Pull Request on Github.

## Problems

Status | Source | Problem Name | Difficulty | Tags | Solution | URL |
---|---|---|---|---|---|---|

CF | Easy | ## Show Tagsconvex | Check CF | |||

Plat | Normal | ## Show Tagsconvex | External Sol | |||

CF | Normal | ## Show Tagsconvex, PURS | Check CF | |||

Old Gold | Normal | ## Show Tagsconvex | External Sol | |||

Kattis | Hard | ## Show Tagsconvex | Show Sketch | |||

AC | Very Hard | ## Show Tagsconvex | Check AC |

### Module Progress:

### Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!

## Give Us Feedback on Convex Hull!

Leave suggestions for us by making a post on the USACO Forum! Ex: Unclear sections, mislabeled problems, etc.