作者: Minati De , Gill Barequet
DOI: 10.1007/978-3-319-53007-9_3
关键词:
摘要: The concept of convex polygon-offset distance function was introduced in 2001 by Barequet, Dickerson, and Goodrich. Using this notion point-to-point distance, they showed how to compute the corresponding nearest- farthest-site Voronoi diagram for a set points. In paper we generalize be from point any object with respect an m-sided polygon, study diagrams sets line segments polygons. We show that combinatorial complexity nearest-site n disjoint is O(nm), which asymptotically equal sites same function. addition, result polygonal sites. sites, each having at most k sides, \(O(n(m+k))\). Finally, tree-like structure complexity.