TY - GEN
T1 - Semi voronoi diagrams
AU - Cheng, Yongxi
AU - Li, Bo
AU - Xu, Yinfeng
PY - 2011
Y1 - 2011
N2 - We consider a problem that is a variant of the Voronoi diagram problem on the Euclidean plane, with the association of a given direction to each point p i in P. For each p i , the direction defines a visible half plane of p i . A point p in the plane is said to be controlled by p i if: (1) p is visible to p i ; (2) among all the points in P that p is visible to, p i is the closest one to p. The members in P partition the plane into different connected regions, each region is controlled by a member in P or is not controlled by any member in P. We give some preliminary results on this partition and propose some problems for future studies.
AB - We consider a problem that is a variant of the Voronoi diagram problem on the Euclidean plane, with the association of a given direction to each point p i in P. For each p i , the direction defines a visible half plane of p i . A point p in the plane is said to be controlled by p i if: (1) p is visible to p i ; (2) among all the points in P that p is visible to, p i is the closest one to p. The members in P partition the plane into different connected regions, each region is controlled by a member in P or is not controlled by any member in P. We give some preliminary results on this partition and propose some problems for future studies.
UR - https://www.scopus.com/pages/publications/81255214458
U2 - 10.1007/978-3-642-24983-9_3
DO - 10.1007/978-3-642-24983-9_3
M3 - 会议稿件
AN - SCOPUS:81255214458
SN - 9783642249822
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 19
EP - 26
BT - Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Revised Selected Papers
T2 - 9th International Conference on Computational Geometry, Graphs and Applications, CGGA 2010
Y2 - 3 November 2010 through 6 November 2010
ER -