Dynamic computational geometry
Mikhail J. Atallah · 1983
We consider problems in computational geometry when every one of the input points is moving in a prescribed manner. We present and analyze efficient algorithms for a number of problems and prove lower bounds for some of them.