Computational geometry: an introduction
Computational geometry: an introduction
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Data structures for halfplane proximity queries and incremental voronoi diagrams
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
We consider a problem that is a variant of the Voronoi diagram problem on the Euclidean plane, with the association of a given direction $\vec{d_i}$ to each point pi in P. For each pi, the direction $\vec{d_i}$ defines a visible half plane of pi. A point p in the plane is said to be controlled by pi if: (1) p is visible to pi; (2) among all the points in P that p is visible to, pi 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.