Cover Contact Graphs.

Atienza, Nieves and Castro, Natalia de and Cortés, Carmen and Garrido, M. Ángeles and Grima, Clara I. and Hernández Peñalver, Gregorio and Márquez, Alberto and Moreno, Auxiliadora and Nöllenburg, Martin and Portillo, José Ramon and Reyes, Pedro and Valenzuela, Jesús and Villar, Maria Trinidad and Wolff, Alexander (2008). Cover Contact Graphs.. In: "15th International Symposium on Graph Drawing, GD 2007", 23/09/2007-26/09/2007, Sydney, Australia. ISBN 978-3-540-77536-2.


Title: Cover Contact Graphs.
  • Atienza, Nieves
  • Castro, Natalia de
  • Cortés, Carmen
  • Garrido, M. Ángeles
  • Grima, Clara I.
  • Hernández Peñalver, Gregorio
  • Márquez, Alberto
  • Moreno, Auxiliadora
  • Nöllenburg, Martin
  • Portillo, José Ramon
  • Reyes, Pedro
  • Valenzuela, Jesús
  • Villar, Maria Trinidad
  • Wolff, Alexander
Item Type: Presentation at Congress or Conference (Article)
Event Title: 15th International Symposium on Graph Drawing, GD 2007
Event Dates: 23/09/2007-26/09/2007
Event Location: Sydney, Australia
Title of Book: Graph Drawing. Proceedings of the 15th International Symposium on Graph Drawing, GD 2007
Date: 2008
ISBN: 978-3-540-77536-2
Volume: 4875
Faculty: Facultad de Informática (UPM)
Department: Matemática Aplicada
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[thumbnail of INVE_MEM_2008_61301.pdf]
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (841kB) | Preview


We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) by a set of other geometric objects (a so-called cover, e.g., a set of disks or homothetic triangles). We insist that the interiors of the seeds and the cover elements are pair wise disjoint, but they can touch. We call the contact graph of a cover a cover contact graph (CCG). We are interested in two types of tasks: (a) deciding whether a given seed set has a connected CCG, and (b) deciding whether a given graph has a realization as a CCG on a given seed set. Concerning task (a) we give efficient algorithms for the case that seeds are points and covers are disks or triangles. We show that the problem becomes NP-hard if seeds and covers are disks. Concerning task (b) we show that it is even NP-hard for point seeds and disk covers (given a fixed correspondence between vertices and seeds).

More information

Item ID: 4948
DC Identifier:
OAI Identifier:
Official URL:
Deposited by: Memoria Investigacion
Deposited on: 18 Nov 2010 13:08
Last Modified: 20 Apr 2016 13:57
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM