Farthest-Polygon Voronoi Diagrams - Computer Science > Computational GeometryReportar como inadecuado




Farthest-Polygon Voronoi Diagrams - Computer Science > Computational Geometry - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Given a family of k disjoint connected polygonal sites in general positionand of total complexity n, we consider the farthest-site Voronoi diagram ofthese sites, where the distance to a site is the distance to a closest point onit. We show that the complexity of this diagram is On, and give an On log^3n time algorithm to compute it. We also prove a number of structuralproperties of this diagram. In particular, a Voronoi region may consist of k-1connected components, but if one component is bounded, then it is equal to theentire region.



Autor: Otfried Cheong KAIST CS, Hazel Everett INRIA Lorraine - LORIA, Marc Glisse INRIA Sophia Antipolis - INRIA Saclay - Ile de France,

Fuente: https://arxiv.org/







Documentos relacionados