License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SOCG.2015.689
URN: urn:nbn:de:0030-drops-50925
URL: http://drops.dagstuhl.de/opus/volltexte/2015/5092/
Go to the corresponding LIPIcs Volume Portal


Chang, Hsien-Chih ; Har-Peled, Sariel ; Raichel, Benjamin

From Proximity to Utility: A Voronoi Partition of Pareto Optima

pdf-format:
9.pdf (0.6 MB)


Abstract

We present an extension of Voronoi diagrams where not only the distance to the site is taken into account when considering which site the client is going to use, but additional attributes (i.e., prices or weights) are also considered. A cell in this diagram is then the loci 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.

BibTeX - Entry

@InProceedings{chang_et_al:LIPIcs:2015:5092,
  author =	{Hsien-Chih Chang and Sariel Har-Peled and Benjamin Raichel},
  title =	{{From Proximity to Utility: A Voronoi Partition of Pareto Optima}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{689--703},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Lars Arge and J{\'a}nos Pach},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5092},
  URN =		{urn:nbn:de:0030-drops-50925},
  doi =		{10.4230/LIPIcs.SOCG.2015.689},
  annote =	{Keywords: Voronoi diagrams, expected complexity, backward analysis, Pareto optima, candidate diagram, Clarkson-Shor technique}
}

Keywords: Voronoi diagrams, expected complexity, backward analysis, Pareto optima, candidate diagram, Clarkson-Shor technique
Seminar: 31st International Symposium on Computational Geometry (SoCG 2015)
Issue Date: 2015
Date of publication: 11.06.2015


DROPS-Home | Fulltext Search | Imprint Published by LZI