voronoi diagram with visual restriction

ISCAS OpenIR

	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
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	36-46
会议日期	May 14, 2012 - May 16, 2012
会议地点	Beijing, China
收录类别	EI
ISSN	0302-9743
ISBN	9783642296994
部门归属	(1) Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China; (2) Institute of Software Chinese Academy of Sciences China; (3) Top Key Discipline of Computer Software and Theory Zhejiang Provincial Colleges Zhejiang Normal University China; (4) Department of Computer Science Montana State University Bozeman MT 59717 United States
摘要	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 ²). Then we give an O(n ²logn) time and O(n ²) space algorithm to construct VRVD. © 2012 Springer-Verlag.; 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 ²). Then we give an O(n ²logn) time and O(n ²) space algorithm to construct VRVD. © 2012 Springer-Verlag.
关键词	Algorithms Computational Geometry
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15722
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Fan Chenglin,Luo Jun,Wang Wencheng,et al. voronoi diagram with visual restriction[C],2012:36-46.