Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative and not necessarily equal. It is allowed that circles intersect each other, and a circle contains others. The proposed algorithm constructs the correct Voronoi diagram as a sweepline moves on the plane from top to bottom. While moving on the plane, the sweepline stops only at certain event points where the topology changes occur for the Voronoi diagram being constructed. The worst-case time complexity of the proposed algorithm is $O((n+m)log n)$, where $n$ is the number of input circles, and $m$ is the number of intersection points among circles. As $m$ can be $O(n^22)$, the presented algorithm is optimal with $O(n^2 log n) $ worst-case time complexity.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

We study the multiplicative Hilbert matrix, i.e. the infinite matrix with entries (mn−−−√log(mn))−1 for m,n≥2. This matrix was recently introduced within the context of the theory of Dirichlet series, and it was shown that the multiplicative Hilbert matrix has no eigenvalues and that its continuous spectrum coincides with [0,π]. Here we prove that the multiplicative Hilbert matrix has no singular continuous spectrum and that its absolutely continuous spectrum has multiplicity one. Our argument relies on spectral perturbation theory and scattering theory. Finding an explicit diagonalisation of the multiplicative Hilbert matrix remains an interesting open problem.