Name
Abstract | ||
|---|---|---|
In a normal Voronoi diagram, each site is able to see all the points in the plane. In this paper, we study the case such that each site is only able to see a visually restricted region in the plane and construct the so-called Visual Restriction Voronoi Diagram (VRVD). We show that the visual restriction Voronoi cell of each site is not necessary convex and it could consist of many disjoint regions. We prove that the combinatorial complexity of the VRVD on n sites is Θ(n 2). Then we give an O (n 2logn ) time and O (n 2) space algorithm to construct VRVD. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-29700-7_4 | Theoretical Computer Science |
Keywords | DocType | Volume |
normal voronoi diagram,so-called visual restriction voronoi,restricted region,space algorithm,n site,visual restriction voronoi cell,disjoint region,necessary convex,combinatorial complexity | Conference | 532 |
ISSN | Citations | PageRank |
0304-3975 | 1 | 0.35 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chenglin Fan | 1 | 28 | 7.24 |
| Jun Luo | 2 | 222 | 26.61 |
| Wencheng Wang | 3 | 270 | 37.99 |
| Binhai Zhu | 4 | 903 | 109.96 |