On the Structure of Higher Order Voronoi Cells
- 1 Downloads
The classic Voronoi cells can be generalized to a higher order version by considering the cells of points for which a given k-element subset of the set of sites consists of the k closest sites. We study the structure of the k-order Voronoi cells and illustrate our theoretical findings with a case study of two-dimensional higher order Voronoi cells for four points.
KeywordsHigher order Voronoi cells Structure of Voronoi cells
We are grateful to the two referees for their thoughtful and thorough corrections and suggestions, including the proof of Proposition 3.10. These corrections have greatly improved the quality of our paper. The first author was supported by the MINECO of Spain, Grant MTM2014-59179-C2-2-P, and the Severo Ochoa Programme for Centres of Excellence in R&D [SEV-2015-0563]. He is affiliated to MOVE (Markets, Organizations and Votes in Economics). He thanks The School of Mathematics and Statistics of UNSW Sydney for sponsoring a visit to Sidney to complete this work. The second author is grateful to the Australian Research Council for continuous financial support via grants DE150100240 and DP180100602, which in particular sponsored a trip to Barcelona that initiated this collaboration. The third author was partially supported by MINECO of Spain and ERDF of EU, Grant MTM2014-59179-C2-1-P, and Sistema Nacional de Investigadores, Mexico.
- 1.Shamos, M., Hoey, D.: Closest-point problems. In: 16th Annual Symposium on Foundations of Computer Science (sfcs 1975) pp. 730–743 (1975)Google Scholar
- 2.Papadopoulou, E., Zavershynskyi, M.: On higher order Voronoi diagrams of line segments. In: Algorithms and computation, Lecture Notes in Comput. Sci., vol. 7676, pp. 177–186. Springer, Heidelberg (2012)Google Scholar
- 5.Gemsa, A., Lee, D.T., Liu, C.H., Wagner, D.: Higher order city Voronoi diagrams. In: Algorithm Theory—SWAT 2012, Lecture Notes in Comput. Sci., vol. 7357, pp. 59–70. Springer, Heidelberg (2012)Google Scholar
- 6.Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P., Sharir, M.: Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2495–2504. SIAM, Philadelphia, PA (2017)Google Scholar
- 7.Klein, R.: Abstract Voronoĭ diagrams and their applications (extended abstract). In: Computational geometry and its applications (Würzburg, 1988), Lecture Notes in Comput. Sci., vol. 333, pp. 148–157. Springer, New York (1988)Google Scholar
- 10.Giansiracusa, N., Ricciardi, C.: Spatial analysis of U.S. Supreme Court 5-to-4 decisions (2018)Google Scholar
- 11.Kolahdouzan, M., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases—Volume 30, VLDB ’04, pp. 840–851. VLDB Endowment (2004)Google Scholar
- 12.Goberna, M.A., López, M.A.: Linear Semi-infinite Optimization, Wiley Series in Mathematical Methods in Practice, vol. 2. Wiley, Chichester (1998)Google Scholar
- 14.Zavershynskyi, M., Papadopoulou, E.: A sweepline algorithm for higher order Voronoi diagrams. In: 2013 10th International Symposium on Voronoi Diagrams in Science and Engineering, pp. 16–22 (2013)Google Scholar