Abstract
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 p i in P. For each p i , the direction \(\vec{d_i}\) 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aronov, B., Bose, P., Demaine, E.D., Gudmundsson, J., Iacono, J., Langerman, S., Smid, M.: Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 80–92. Springer, Heidelberg (2006)
Aurenhammer, F.: Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure. ACM Computing Surveys 23, 345–405 (1991)
Daescu, O., Mi, N., Shin, C.-S., Wolff, A.: Farthest-Point Queries with Geometric and Combinatorial Constraints. Computational Geometry 33, 174–185 (2006)
Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)
Voronoi, G.M.: Nouvelles applications des paramètres continus à la théorie des formes quadratiques. deuxième Mémoire: Recherches sur les parallélloèdres primitifs. J. Reine Angew. Math. 134, 198–287 (1908)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, Y., Li, B., Xu, Y. (2011). Semi Voronoi Diagrams. In: Akiyama, J., Bo, J., Kano, M., Tan, X. (eds) Computational Geometry, Graphs and Applications. CGGA 2010. Lecture Notes in Computer Science, vol 7033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24983-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-24983-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24982-2
Online ISBN: 978-3-642-24983-9
eBook Packages: Computer ScienceComputer Science (R0)