We provide an O (n\, polylog\, n) O (n polylog n) bound on the expected complexity of the
randomly weighted multiplicative Voronoi diagram of a set of nn sites in the plane, where the …

Wireless RF power transfer requires the deployment of multiple energy transmitters (ETs) to
cover an entire area of interest. This letter aims at bounding the minimum cumulative power …

In this paper, we provide an O (n polylog n) bound on the expected complexity of the
randomly weighted Voronoi diagram of a set of n sites in the plane, where the sites can be …

The worst-case analysis is a key element of the performance analysis of algorithms. When it
comes to spatial data, such as paths of moving objects and digital terrain models, the …

We investigate the combinatorial complexity of geodesic Voronoi diagrams on polyhedral
terrains using a probabilistic analysis. Aronov et al.[2008] prove that, if one makes certain …

Powering wireless sensors has become a key challenge to enable the Internet of Things
vision. A common approach to achieve this is to use Energy Harvesting. By means of this …

While the standard unweighted Voronoi diagram in the plane has linear worst-case
complexity, many of its natural generalizations do not. This paper considers two such …

Many computational problems arise naturally from geometric data. In this thesis, we consider
three such problems:(i) distance optimization problems over point sets,(ii) computing contour …