Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons

Gill Barequet, Minati De, Michael T. Goodrich

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

Abstract

We provide efficient algorithms for computing compact representations of Voronoi diagrams using a convex-straight-skeleton (i.e., convex polygon offset) distance function when sites are line segments or convex polygons.

Original languageEnglish
Title of host publicationCOMPUTING AND COMBINATORICS (COCOON 2018)
EditorsDaming Zhu, Lusheng Wang
Pages130-142
Number of pages13
Volume10976
DOIs
StatePublished - 2018
Event24th International Conference on Computing and Combinatorics Conference, COCOON 2018 - Qing Dao, China
Duration: 2 Jul 20184 Jul 2018

Publication series

NameLecture Notes in Computer Science

Conference

Conference24th International Conference on Computing and Combinatorics Conference, COCOON 2018
Country/TerritoryChina
CityQing Dao
Period2/07/184/07/18

Keywords

  • Polygon-offset distance
  • Straight skeletons
  • Voronoi diagrams

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Cite this