Abstract
We describe the structure of the Voronoi diagram of lines for a set of points in the plane, thereby making use of an extra dimension. In contrast to previous results in this respect, which were based on the dual representation of the Voronoi diagram under consideration, our approach applies to the primal plane. We also generalize it to higher-dimensional hyperplane spaces.
This is a preview of subscription content, log in via an institution to check access.
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
Aurenhammer, F.: Voronoi diagram—A survey of a fundamental geometric data structure. ACM Computing Surveys 23(3), 345–405 (1991)
Bae, S.W., Shin, C.-S.: The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol. 6507, pp. 230–241. Springer, Heidelberg (2010)
Cole, R., Yap, C.: Geometric retrieval problems. In: Proc 24th IEEE Symp. Foundation of Computer Science (FOCS), pp. 112–121 (1983)
Gavrilova, M. (ed.): Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence. SCI, vol. 158. Springer, Heidelberg (2008)
Edelsbrunner, H., Guibas, L.J.: Topologically sweeping an arrangement. J. Comput. Syst. Sci. 38, 165–194 (1989), Corrigendum in 42, 249–251 (1991)
Hruz, T., Schöngens, M.: A Simple Framework for the Generalized Nearest Neighbor Problem. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 83–94. Springer, Heidelberg (2012)
Lee, D.T., Chiang, Y.: The power of geometric duality revisited. Inf. Process. Lett. 21, 117–122 (1985)
Mitra, P., Mukhopadhyay, A.: Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds.) ICCSA 2003, Part III. LNCS, vol. 2669, pp. 787–796. Springer, Heidelberg (2003)
Nandy, S.C., Das, S., Goswami, P.P.: An efficient k nearest neighbors searching algorithm for a query line. Theor. Comp. Sci. 299, 273–288 (2003)
Okabe, A., Boots, A., Sugihara, B., Chui, S.N.: Spatial Tessellations, 2nd edn. Wiley (2000)
Overmars, M.H., Welzl, E.: New methods for computing visibility graphs. In: Proc. 4th Annu. Symp. Comput. Geom (ACM SoCG), pp. 164–171. ACM Press (1988)
Rivière, S., Schmitt, D.: Two-dimensional line space Voronoi Diagram. In: Proc. 4th Int. Symp. on Voronoi Diagrams in Science and Engineering (ISVD 2007), pp. 168–175. IEEE CS (2007)
Rivière, S.: Two-dimensional order-k line space Voronoi diagram. In: Voronoi’s Impact on Modern Science, Book 4, Proc. 5th Int. Symp. on Voronoi Diagrams in Science and Engineering (ISVD 2008), vol. 2, pp. 192–202 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schmitt, D., Vyatkina, K. (2013). On Voronoi Diagrams in the Planar Line Space and Their Generalizations. In: Gavrilova, M.L., Tan, C.J.K., Kalantari, B. (eds) Transactions on Computational Science XX. Lecture Notes in Computer Science, vol 8110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41905-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-41905-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41904-1
Online ISBN: 978-3-642-41905-8
eBook Packages: Computer ScienceComputer Science (R0)