On multiplicatively weighted voronoi diagrams for lines in the plane

Kira Vyatkina, Gill Barequet

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

We describe a method based on the wavefront propagation, which computes a multiplicatively weighted Voronoi diagram for a set L of n lines in the plane in O(n 2 logn) time and O(n 2) space. In the process, we derive complexity bounds and certain structural properties of such diagrams. An advantage of our approach over the general purpose machinery, which requires computation of the lower envelope of a set of halfplanes in three-dimensional space, lies in its relative simplicity. Besides, we point out that the unweighted Voronoi diagram for n lines in the plane has a simple structure, and can be obtained in optimal Θ(n 2) time and space.

Original languageEnglish
Title of host publicationTransactions on Computational Science XIII
EditorsMarina Gavrilova, Chih Jeng Kenneth Tan
Pages44-71
Number of pages28
DOIs
StatePublished - 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6750 LNCS

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On multiplicatively weighted voronoi diagrams for lines in the plane'. Together they form a unique fingerprint.

Cite this