Name
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s00453-021-00824-9 | ALGORITHMICA |
Keywords | DocType | Volume |
Voronoi diagram, Polygon offset distance, Straight skeleton | Journal | 83 |
Issue | ISSN | Citations |
7 | 0178-4617 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Barequet | 1 | 26 | 4.31 |
| Minati De | 2 | 45 | 10.11 |
| Michael T. Goodrich | 3 | 4351 | 331.47 |