Lecture 27

Ripan Chowdhury: A thorough overview of Convex Hulls
Jackson Lindsay: Kinetic Data Structures
Dwight Nwaigwe: A Conjectured Expected Linear Time Convex Hull Algorithm for Points Uniformly Distributed on the Unit Square

Ripan: Kirkpatrick, D. G., & Seidel, R. (1986). The ultimate planar convex hull algorithm?. SIAM journal on computing, 15(1), 287-299.
Ripan: Chan, T. M. (1996). Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete & Computational Geometry, 16(4), 361-368.
Jackson: Basch, J., Guibas, L. J., & Hershberger, J. (1999). Data structures for mobile data. Journal of Algorithms, 31(1), 1-28.
Jackson: Abam, M. A. (2007). New data structures and algorithms for mobile data Eindhoven: Technische Universiteit Eindhoven DOI: 10.6100/IR630204
See also a related poster by Mohammad Abam
Dwight: Devroye, L., & Toussaint, G. T. (1981). A note on linear expected time algorithms for finding convex hulls. Computing, 26(4), 361-366.
Dwight: McQueen, M. M., & Toussaint, G. T. (1985). On the ultimate convex hull algorithm in practice. Pattern Recognition Letters, 3(1), 29-34.