中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
Voronoi diagram with visual restriction
Author: Fan, Chenglin (1) ; Luo, Jun (1) ; Wang, Wencheng (3) ; Zhu, Binhai (4)
Corresponding Author: Luo, J.(jun.luo@siat.ac.cn)
Keyword: Voronoi diagram ; Visual restriction ; Computational geometry
Source: Theoretical Computer Science
Issued Date: 2013
Volume: 532, Pages:31-39
Indexed Type: SCI ; EI
Department: (1) Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, China; (2) Huawei Noah's Ark Laboratory, Hong Kong; (3) Institute of Software, Chinese Academy of Sciences, China; (4) Department of Computer Science, Montana State University, Bozeman, MT 59717, USA
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 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.
English 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 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.
Language: 英语
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16863
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Fan, Chenglin ,Luo, Jun ,Wang, Wencheng ,et al. Voronoi diagram with visual restriction[J]. Theoretical Computer Science,2013-01-01,532:31-39.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Fan, Chenglin (1)]'s Articles
[Luo, Jun (1)]'s Articles
[Wang, Wencheng (3)]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Fan, Chenglin (1)]‘s Articles
[Luo, Jun (1)]‘s Articles
[Wang, Wencheng (3)]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace