作者: Gill Barequet , Minati De , Michael T. Goodrich
DOI: 10.1007/S00453-021-00824-9
关键词:
摘要: In this paper, we study the convex-straight-skeleton Voronoi diagrams of line segments and convex polygons. We explore combinatorial complexity these diagrams, provide efficient algorithms for computing compact representations them.