Voronoi diagrams of moving points in the plane and of lines in space: Tight bounds for simple configurations

Amit Weisman, L. Paul Chew, Klara Kedem

Research output: Contribution to journalArticlepeer-review

Abstract

The combinatorial complexities of (1) the Voronoi diagram of moving points in 2D and (2) the Voronoi diagram of lines in 3D, both under the Euclidean metric, continues to challenge geometers because of the open gap between the ω (n2) lower bound and the O(n3+ε) upper bound. Each of these two combinatorial problems has a closely related problem involving Minkowski sums: (1′) the complexity of a Minkowski sum of a planar disk with a set of lines in 3D and (2′) the complexity of a Minkowski sum of a sphere with a set of lines in 3D. These Minkowski sums can be considered "cross-sections" of the corresponding Voronoi diagrams. Of the four complexity problems mentioned, problems (1′) and (2′) have recently been shown to have a nearly tight bound: both complexities are O(n2+ε) with lower bound ω(n2). In this paper, we determine the combinatorial complexities of these four problems fro some very simple input configurations. In particular, we study point configurations with just two degrees of freedom (DOFs), exploring both the Voronoi diagrams and the corresponding Minkowski sums. We consider the traditional versions of these problems to have 4 DOFs. We show that even for these simple configurations the combinatorial complexities have upper bounds of either O(n2) or O(n2+) and lower bounds of ω (n 2).

Original languageEnglish
Pages (from-to)245-251
Number of pages7
JournalInformation Processing Letters
Volume92
Issue number5
DOIs
StatePublished - 16 Dec 2004

Keywords

  • Combinatorial problems
  • Computational geometry
  • Voronoi diagrams

Fingerprint

Dive into the research topics of 'Voronoi diagrams of moving points in the plane and of lines in space: Tight bounds for simple configurations'. Together they form a unique fingerprint.

Cite this