作者: G. Barequet , M. T. Dickerson , M. T. Goodrich
关键词: Offset distance 、 Convex polygon 、 Combinatorics 、 Weighted Voronoi diagram 、 Mathematics 、 Offset (computer science) 、 Voronoi diagram 、 Centroidal Voronoi tessellation 、 Power diagram
摘要: In this paper we develop the concept of a convexpolygon-offset distance function. Using offset as notion distance, show how to compute corresponding nearest- and furthest-site Voronoi diagrams point sites in plane. We provide near-optimal deterministicO(n(logn + log2m) +m)-time algorithms, wheren is number points andm complexity underlying polygon, for computing compact representations both diagrams.