License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2020.79
URN: urn:nbn:de:0030-drops-122371
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12237/
Go to the corresponding LIPIcs Volume Portal


Buchin, Kevin ; Hagedoorn, Mart ; Kostitsyna, Irina ; van Mulken, Max ; Rensen, Jolan ; van Schooten, Leo

Dots & Polygons (Media Exposition)

pdf-format:
LIPIcs-SoCG-2020-79.pdf (0.5 MB)


Abstract

We present a new game, Dots & Polygons, played on a planar point set. We prove that its NP-hard and discuss strategies for the case when the point set is in convex position.

BibTeX - Entry

@InProceedings{buchin_et_al:LIPIcs:2020:12237,
  author =	{Kevin Buchin and Mart Hagedoorn and Irina Kostitsyna and Max van Mulken and Jolan Rensen and Leo van Schooten},
  title =	{{Dots & Polygons (Media Exposition)}},
  booktitle =	{36th International Symposium on Computational Geometry (SoCG 2020)},
  pages =	{79:1--79:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-143-6},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{164},
  editor =	{Sergio Cabello and Danny Z. Chen},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12237},
  URN =		{urn:nbn:de:0030-drops-122371},
  doi =		{10.4230/LIPIcs.SoCG.2020.79},
  annote =	{Keywords: Dots & Boxes, NP-hard, game, cycle packing}
}

Keywords: Dots & Boxes, NP-hard, game, cycle packing
Collection: 36th International Symposium on Computational Geometry (SoCG 2020)
Issue Date: 2020
Date of publication: 08.06.2020
Supplementary Material: game: https://www.win.tue.nl/~kbuchin/proj/ruler/dotsandpolygons/, source code: https://github.com/kbuchin/ruler/tree/dots-and-polygons


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI