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.ESA.2018.69
URN: urn:nbn:de:0030-drops-95320
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9532/
Go to the corresponding LIPIcs Volume Portal

Raman, Rajiv ; Ray, Saurabh

Planar Support for Non-piercing Regions and Applications

pdf-format:
LIPIcs-ESA-2018-69.pdf (0.7 MB)

Abstract

Given a hypergraph H=(X,S), a planar support for H is a planar graph G with vertex set X, such that for each hyperedge S in S, the sub-graph of G induced by the vertices in S is connected. Planar supports for hypergraphs have found several algorithmic applications, including several packing and covering problems, hypergraph coloring, and in hypergraph visualization.
The main result proved in this paper is the following: given two families of regions R and B in the plane, each of which consists of connected, non-piercing regions, the intersection hypergraph H_R(B) = (B, {B_r}_{r in R}), where B_r = {b in B: b cap r != empty set} has a planar support. Further, such a planar support can be computed in time polynomial in |R|, |B|, and the number of vertices in the arrangement of the regions in R cup B. Special cases of this result include the setting where either the family R, or the family B is a set of points.
Our result unifies and generalizes several previous results on planar supports, PTASs for packing and covering problems on non-piercing regions in the plane and coloring of intersection hypergraph of non-piercing regions.

BibTeX - Entry

@InProceedings{raman_et_al:LIPIcs:2018:9532,
  author =	{Rajiv Raman and Saurabh Ray},
  title =	{{Planar Support for Non-piercing Regions and Applications}},
  booktitle =	{26th Annual European Symposium on Algorithms (ESA 2018)},
  pages =	{69:1--69:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-081-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{112},
  editor =	{Yossi Azar and Hannah Bast and Grzegorz Herman},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9532},
  URN =		{urn:nbn:de:0030-drops-95320},
  doi =		{10.4230/LIPIcs.ESA.2018.69},
  annote =	{Keywords: Geometric optimization, packing and covering, non-piercing regions}
}

Keywords: Geometric optimization, packing and covering, non-piercing regions
Collection: 26th Annual European Symposium on Algorithms (ESA 2018)
Issue Date: 2018
Date of publication: 14.08.2018

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