Voronoi diagrams of rigidly moving sets of points

Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)217-223
Number of pages7
JournalInformation Processing Letters
Volume43
Issue number4
DOIs
StatePublished - 28 Sep 1992
Externally publishedYes

Keywords

  • Analysis of algorithms
  • Voronoi diagrams
  • computational geometry

Fingerprint

Dive into the research topics of 'Voronoi diagrams of rigidly moving sets of points'. Together they form a unique fingerprint.

Cite this