Next: Implementation
Up: Graham's Algorithm
Previous: Issues
Graham's algorithm needs to deal with many degeneracies in the input.
Collinearities: More than 3 points are collinear
- Notion of strict left turn
(if no collinearities are wanted)
- Sorting Collinearities: based on angles. If two or more points subtend
the same angle, we sort them based on edge lengths.
Dinesh Manocha
Tue Feb 17 23:44:05 EST 1998