• Citer

The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon

par Oh, Eunjin;Barba Flores, Luis ;Ahn, Hee Kap
Référence Leibniz international proceedings in informatics, 51, page (56.1-56.15)
Publication Publié, 2016-06

Article révisé par les pairs

• Détails
• Contenu

Résumé :

Given a set of sites (points) in a simple polygon, the farthest-point geodesic Voronoi diagram partitions the polygon into cells, at most one cell per site, such that every point in a cell has the same farthest site with respect to the geodesic metric. We present an O((n + m) log log n)-time algorithm to compute the farthest-point geodesic Voronoi diagram for m sites lying on the boundary of a simple n-gon.