Title :
Dynamic computational geometry
Author :
Atallah, Mikhail J.
Abstract :
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.
Keywords :
Algorithm design and analysis; Arithmetic; Computational geometry; Polynomials; Terminology;
Conference_Titel :
Foundations of Computer Science, 1983., 24th Annual Symposium on
Conference_Location :
Tucson, AZ, USA
Print_ISBN :
0-8186-0508-1
DOI :
10.1109/SFCS.1983.13
