Voronoi diagram with visual restriction
文献类型：期刊论文
| 作者 | Fan, Chenglin; Luo, Jun; Wang, Wencheng; Zhu, Binhai |
| 刊名 | THEORETICAL COMPUTER SCIENCE
 |
| 出版日期 | 2014 |
| 英文摘要 | 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 necessarily convex and it could consist of many disjoint regions. We prove that the combinatorial complexity of the VRVD on n sites is Theta(n(2)), and then show that the VRVD can be constructed in O(n(2)) time and O(n(2)) space. Besides that, we also give another algorithm with an extra log n factor of running time to compute VRVD, which is easy to implement in practice. (C) 2013 Elsevier B.V. All rights reserved. |
| 收录类别 | SCI |
| 原文出处 | http://www.sciencedirect.com/science/article/pii/S0304397513006051 |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/5956]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | THEORETICAL COMPUTER SCIENCE |
| 推荐引用方式 GB/T 7714 | Fan, Chenglin,Luo, Jun,Wang, Wencheng,et al. Voronoi diagram with visual restriction[J]. THEORETICAL COMPUTER SCIENCE,2014. |
| APA | Fan, Chenglin,Luo, Jun,Wang, Wencheng,&Zhu, Binhai.(2014).Voronoi diagram with visual restriction.THEORETICAL COMPUTER SCIENCE. |
| MLA | Fan, Chenglin,et al."Voronoi diagram with visual restriction".THEORETICAL COMPUTER SCIENCE (2014). |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。