| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421157 | Discrete Applied Mathematics | 2014 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
F. Aurenhammer, B. Su, Y.-F. Xu, B. Zhu,