A note on visibility-constrained Voronoi diagrams

We consider a variant of visibility-constrained Voronoi diagrams for nn given point sites in the Euclidean plane. Whereas such diagrams typically are of size Ω(n2)Ω(n2), the combinatorial and algorithmic complexity of the studied variant is significantly subquadratic in nn.