@InProceedings{eder_et_al:LIPIcs.SoCG.2020.85,
  author =	{Eder, G\"{u}nther and Held, Martin and de Lorenzo, Stefan and Palfrader, Peter},
  title =	{{Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions}},
  booktitle =	{36th International Symposium on Computational Geometry (SoCG 2020)},
  pages =	{85:1--85:11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-143-6},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{164},
  editor =	{Cabello, Sergio and Chen, Danny Z.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.85},
  URN =		{urn:nbn:de:0030-drops-122438},
  doi =		{10.4230/LIPIcs.SoCG.2020.85},
  annote =	{Keywords: Computational Geometry, geometric optimization, algorithm engineering, convex decomposition}
}