跳到主要导航 跳到搜索 跳到主要内容

Half-plane Voronoi diagram

  • Shenzhen Institute of Advanced Technology

科研成果: 书/报告/会议事项章节会议稿件同行评审

5 引用 (Scopus)

摘要

In normal Voronoi diagram, each site is able to see all points in the plane. In this paper, we study the problem such that each site is only able to see half-plane and construct the so-called Half-plane Voronoi Diagram (HPVD). We show that the half-plane Voronoi cell of each site is not necessary convex and it could consist of many disjoint regions. We prove that the complexity of the HPVD of n sites is O(n2). Then we give an algorithm of O(n log n) time and O(n) space to construct HPVD such that the boundary lines of all half-planes are parallel and the visible half-planes are in the same side of the corresponding boundary lines. For the parallel boundary lines where the visible half-planes could be in either side of the corresponding boundary lines, we give an algorithm of O(n2) time and O(n2) space to construct HPVD.

源语言英语
主期刊名Proceedings - 2011 8th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2011
127-133
页数7
DOI
出版状态已出版 - 2011
活动2011 8th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2011 - Qingdao, 中国
期限: 28 6月 201130 6月 2011

出版系列

姓名Proceedings - 2011 8th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2011

会议

会议2011 8th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2011
国家/地区中国
Qingdao
时期28/06/1130/06/11

学术指纹

探究 'Half-plane Voronoi diagram' 的科研主题。它们共同构成独一无二的指纹。

引用此