论文信息 - 2-point site Voronoi diagrams

2-point site Voronoi diagrams

In this paper we investigate a new type of Voronoi diagrams in which every region is defined by a pair of point sites and some distance function from a point to two points. We analyze the complexity of the respective nearest- and furthest-neighbor diagrams of several such distance functions, and show how to compute the diagrams efficiently.

[1] D. T. Lee,et al. Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..

[2] Micha Sharir,et al. On the Zone Theorem for Hyperplane Arrangements , 1991, SIAM J. Comput..

[3] M. R. Spiegel. Mathematical handbook of formulas and tables , 1968 .

[4] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[5] D. T. Lee,et al. On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.

[6] Leonidas J. Guibas,et al. Computing convolutions by reciprocal search , 1986, SCG '86.

[7] E. Szemerédi,et al. Crossing-Free Subgraphs , 1982 .

[8] M. Sharir,et al. Davenport{schinzel Sequences and Their Geometric Applications 1 Davenport{schinzel Sequences and Their Geometric Applications , 1995 .

[9] F. Thomas Leighton,et al. Complexity Issues in VLSI , 1983 .

[10] Chee-Keng Yap,et al. AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..

[11] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .

[12] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[13] D. T. Lee,et al. Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.

[14] Steven Fortune,et al. A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.