Given a family of k disjoint connected polygonal sites in general position and of total
complexity n, we consider the farthest-site Voronoi diagram of these sites, where the …

The order-k k Voronoi diagram of line segments has properties surprisingly different from its
counterpart for points. For example, a single order-k k Voronoi region may consist …

We address the problem of computing critical area for open faults (opens) in a circuit layout
in the presence of multilayer loops and redundant interconnects. The extraction of critical …

The farthest line-segment Voronoi diagram illustrates properties surprisingly different from its
counterpart for points: Voronoi regions may be disconnected and they are not characterized …

Let $\mathcal {P} $ be a simple polygon with $ m $ vertices and let $ P $ be a set of $ n $
points inside $\mathcal {P} $. We prove that there exists, for any $\varepsilon> 0$, a set …

Stabbing a set S of n segments in the plane by a line is a well-known problem. In this paper
we consider the variation where the stabbing object is a circle instead of a line. We show …

Abstract Abstract Voronoi diagrams [15, 16] are based on bisecting curves enjoying simple
combinatorial properties, rather than on the geometric notions of sites and circles. They …

We present linear-time algorithms to construct tree-like Voronoi diagrams with disconnected
regions after the sequence of their faces along an enclosing boundary (or at infinity) is …

Given a set of n non-intersecting line segments L and a set Q of m points in R 2; we present
algorithms of the discrete two-center problem for (i) covering,(ii) stabbing and (iii) hitting the …

A Sweepline Algorithm for Higher Order Voronoi Diagrams Page 1 A Sweepline Algorithm for
Higher Order Voronoi Diagrams∗ Maksym Zavershynskyi Faculty of Informatics, Universit`a …