DocumentCode
2181255
Title
Dynamic computational geometry
Author
Atallah, Mikhail J.
fYear
1983
fDate
7-9 Nov. 1983
Firstpage
92
Lastpage
99
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1983., 24th Annual Symposium on
Conference_Location
Tucson, AZ, USA
ISSN
0272-5428
Print_ISBN
0-8186-0508-1
Type
conf
DOI
10.1109/SFCS.1983.13
Filename
4568065
Link To Document