Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 2245-2272 |
Number of pages | 28 |
Journal | Algorithmica |
Volume | 83 |
Issue number | 7 |
DOIs | |
State | Published - Jul 2021 |
Keywords
- Polygon offset distance
- Straight skeleton
- Voronoi diagram
All Science Journal Classification (ASJC) codes
- General Computer Science
- Computer Science Applications
- Applied Mathematics