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

In this paper, we study the convex-straight-skeleton Voronoi diagrams of line segments and convex polygons. We explore the combinatorial complexity of these diagrams, and provide efficient algorithms for computing compact representations of them.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica 2021-07, Vol.83 (7), p.2245-2272
Hauptverfasser:	Barequet, Gill, De, Minati, Goodrich, Michael T.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Polygons Segments Theory of Computation Voronoi graphs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this paper, we study the convex-straight-skeleton Voronoi diagrams of line segments and convex polygons. We explore the combinatorial complexity of these diagrams, and provide efficient algorithms for computing compact representations of them.
ISSN:	0178-4617 1432-0541
DOI:	10.1007/s00453-021-00824-9