Half-plane Voronoi diagram
文献类型：会议论文
| 作者 | Fan chenglin; Luo jun; Liu jinfei; Xu yingfeng |
| 出版日期 | 2011 |
| 会议名称 | 2011 8th International Symposium on Voronoi Diagrams in Science and Engineering |
| 会议地点 | CHINA |
| 英文摘要 | 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. © 2011 IEEE.(5 refs) |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/3602]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | 2011 |
| 推荐引用方式 GB/T 7714 | Fan chenglin,Luo jun,Liu jinfei,et al. Half-plane Voronoi diagram[C]. 见:2011 8th International Symposium on Voronoi Diagrams in Science and Engineering. CHINA. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。