Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles


We propose an implicit representation for the farthest Voronoi Diagram of a set P of n points in the plane lying outside a set R of m disjoint axes-parallel rectangular obstacles. The distances are measured according to the L1 shortest path (geodesic) metric. In particular, we design a data structure of size O(N) in O(N log N) time that supports O(N logN… (More)

1 Figure or Table


  • Presentations referencing similar topics