Voronoi diagram with visual restriction
文献类型：期刊论文
| 作者 | Fan, Chenglin (1) ; Luo, Jun (1) ; Wang, Wencheng (3) ; Zhu, Binhai (4) |
| 刊名 | Theoretical Computer Science
 |
| 出版日期 | 2013 |
| 卷号 | 532页码:31-39 |
| 关键词 | Voronoi diagram Visual restriction Computational geometry |
| ISSN号 | 3043975 |
| 通讯作者 | Luo, J.(jun.luo@siat.ac.cn) |
| 中文摘要 | 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 Θ (n2), and then show that the VRVD can be constructed in O (n2) time and O (n2) 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. © 2013 Elsevier B.V. All rights reserved. |
| 英文摘要 | 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 Θ (n2), and then show that the VRVD can be constructed in O (n2) time and O (n2) 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. © 2013 Elsevier B.V. All rights reserved. |
| 收录类别 | SCI ; EI |
| 语种 | 英语 |
| 公开日期 | 2014-12-16 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16863]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Fan, Chenglin ,Luo, Jun ,Wang, Wencheng ,et al. Voronoi diagram with visual restriction[J]. Theoretical Computer Science,2013,532:31-39. |
| APA | Fan, Chenglin ,Luo, Jun ,Wang, Wencheng ,&Zhu, Binhai .(2013).Voronoi diagram with visual restriction.Theoretical Computer Science,532,31-39. |
| MLA | Fan, Chenglin ,et al."Voronoi diagram with visual restriction".Theoretical Computer Science 532(2013):31-39. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。