Voronoi diagram with visual restriction
文献类型：会议论文
| 作者 | Fan chenglin; Luo jun; Wang wencheng; Zhu binhai |
| 出版日期 | 2012 |
| 会议名称 | 6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012 |
| 会议地点 | Beijing |
| 英文摘要 | 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 visuallyrestricted 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(n2logn) time and O(n 2) space algorithm to construct VRVD. © 2012 Springer-Verlag.(10 refs) |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/4215]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | 2012 |
| 推荐引用方式 GB/T 7714 | Fan chenglin,Luo jun,Wang wencheng,et al. Voronoi diagram with visual restriction[C]. 见:6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012. Beijing. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。