Convex Hull Algorithms for Dynamic Data
Convex Hull Algorithms for Dynamic Data. Kanat Tangwongsan Joint work with Guy Blelloch and Umut Acar (TTI-C). The Convex Hull Problem. Output: CH ( S). Extensively studied: Graham Scan, Gift-Wrapping, Incremental Hull, Overmars, Quick-Hull, Ultimate Hull. Matched Lower-bound already!.
408 views • 14 slides