A Streaming Algorithm for the Convex Hull

Consider a base station in a wireless sensor network that receives incoming input points and must maintain a running convex hull within a memory constraint. We give a new streaming algorithm that processes each point in time O (log k) where k is the memory constraint, while maintaining an optimal area error of O(1/k²)