From Proximity to Utility: A Voronoi Partition of Pareto Optima
- 237 Downloads
We present an extension of Voronoi diagrams where when considering which site a client is going to use, in addition to the site distances, other site attributes are also considered (for example, prices or weights). A cell in this diagram is then the locus of all clients that consider the same set of sites to be relevant. In particular, the precise site a client might use from this candidate set depends on parameters that might change between usages, and the candidate set lists all of the relevant sites. The resulting diagram is significantly more expressive than Voronoi diagrams, but naturally has the drawback that its complexity, even in the plane, might be quite high. Nevertheless, we show that if the attributes of the sites are drawn from the same distribution (note that the locations are fixed), then the expected complexity of the candidate diagram is near linear. To this end, we derive several new technical results, which are of independent interest. In particular, we provide a high-probability, asymptotically optimal bound on the number of Pareto optima points in a point set uniformly sampled from the d-dimensional hypercube. To do so we revisit the classical backward analysis technique, both simplifying and improving relevant results in order to achieve the high-probability bounds.
KeywordsVoronoi diagrams Expected complexity Backward analysis Pareto optima Candidate diagram Clarkson-Shor technique
The authors would like to thank Pankaj Agarwal, Ken Clarkson, Nirman Kumar, and Raimund Seidel for useful discussions related to this work. We are also grateful to the anonymous SoCG reviewers for their helpful comments. Work on this paper was partially supported by NSF AF award CCF-1421231, and CCF-1217462. A preliminary version of the paper appeared in the 31st International Symposium on Computational Geometry (SoCG 2015) .
- 1.Agarwal, P.K., Matoušek, J., Schwarzkopf, O.: Computing many faces in arrangements of lines and segments. SIAM J. Comput. 27(2), 491–505 (1998). http://epubs.siam.org/sam-bin/dbq/article/26616
- 3.Agarwal, P.K., Aronov, B., Har-Peled, S., Phillips, J.M., Yi, K., Zhang, W.: Nearest neighbor searching under uncertainty. II. In: Proceedings of the 32nd ACM Symposium on Principles of Database Systems (PODS), pp. 115–126 (2013)Google Scholar
- 10.Berg, M., Cheong, O., Kreveld, M., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). http://www.cs.uu.nl/geobook/
- 11.Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th IEEE International Conference on Data Engineering, pp. 421–430 (2001). http://doi.ieeecomputersociety.org/10.1109/ICDE.2001.914855
- 14.Clarkson, K.L.: On the expected number of \(k\)-sets of coordinate-wise independent points (2004). http://cm.bell-labs.com/who/clarkson/cwi_ksets/p.pdf. Manuscript
- 15.Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry. II. Discrete Comput. Geom. 4, 387–421 (1989). http://cm.bell-labs.com/who/clarkson/rs2m.html
- 17.Feldman, A.: Welfare economics. In: Durlauf, S., Blume, L. (eds.) The New Palgrave Dictionary of Economics. Palgrave Macmillan, New York (2008)Google Scholar
- 20.Har-Peled, S., Raichel, B.: On the expected complexity of randomly weighted Voronoi diagrams. In: Proceedings of the 30th Annual Symposium on Computational Geometry (SoCG), pp. 232–241 (2014). doi: 10.1145/2582112.2582158
- 28.Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York (1995). http://us.cambridge.org/titles/catalogue.asp?isbn=0521470250
- 29.Weil, W., Wieacker, J.A.: Stochastic geometry. In: Gruber, P.M., Wills, J.M. (eds.) Handbook of Convex Geometry, vol. B, chap. 5.2, pp. 1393–1438. North-Holland, Amsterdam (1993)Google Scholar