TY - JOUR
T1 - Voronoi diagrams of rigidly moving sets of points
AU - Huttenlocher, Daniel P.
AU - Kedem, Klara
AU - Kleinberg, Jon M.
N1 - Funding Information:
Correspondence to: D.P. Hunenlocher, Department of Computer Science, Cornell University, Ithaca, NY 14853, USA. * This work was supported in part by NSF grant IRI-9057928 and matching funds from General Electric, Kodak and Xerox, and in part by the Air Force Office of Scientific Research under contract AFOSR-91-0328. The second author was supported by a fellowship from the Pikkowski-Valazzi Fund and by the Eshkol grant 04601-90.
PY - 1992/9/28
Y1 - 1992/9/28
N2 - Consider k sets each consisting of n points in the plane, with each set allowed to move rigidly according to some continuous function of time. A paper by Aonuma, Imai, Imai, and Tokuyama shows an upper bound of O(n3k4log*n) on the number of combinatorial changes to the Voronoi diagram of the kn points over all time. We present a bound of O(n2k2λs(k)) for s fixed s, thus improving their result by slightly more than a factor of kn.
AB - Consider k sets each consisting of n points in the plane, with each set allowed to move rigidly according to some continuous function of time. A paper by Aonuma, Imai, Imai, and Tokuyama shows an upper bound of O(n3k4log*n) on the number of combinatorial changes to the Voronoi diagram of the kn points over all time. We present a bound of O(n2k2λs(k)) for s fixed s, thus improving their result by slightly more than a factor of kn.
KW - Analysis of algorithms
KW - Voronoi diagrams
KW - computational geometry
UR - http://www.scopus.com/inward/record.url?scp=0040231871&partnerID=8YFLogxK
U2 - 10.1016/0020-0190(92)90204-9
DO - 10.1016/0020-0190(92)90204-9
M3 - Article
AN - SCOPUS:0040231871
SN - 0020-0190
VL - 43
SP - 217
EP - 223
JO - Information Processing Letters
JF - Information Processing Letters
IS - 4
ER -