Abstract
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 pairwise 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).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abellanas, M., Bereg, S., Hurtado, F., Olaverri, A.G., Rappaport, D., Tejel, J.: Moving coins. Comput. Geom. Theory Appl. 34(1), 35–48 (2006)
Abellanas, M., de Castro, N., Hernández, G., Márquez, A., Moreno-Jiménez, C.: Gear system graphs. Manuscript (2006)
Atienza, N., de Castro, N., Cortés, C., Garrido, M. Á., Grima, C.I., Hernández, G., Márquez, A., Moreno, A., Nöllenburg, M., Portillo, J.R., Reyes, P., Valenzuela, J., Villar, M.T., Wolff, A.: Cover contact graphs. Technical Report 2007-18, Fakultät für Informatik, Universität Karlsruhe (September 2007), http://www.ubka.uni-karlsruhe.de/indexer-vvv/ira/2007/18
Collins, C.R., Stephenson, K.: A circle packing algorithm. Comput. Geom. Theory Appl. 25(3), 233–256 (2003)
de Fraysseix, H., de Mendez, P.O.: Representations by contact and intersection of segments. Algorithmica 47(4), 453–463 (2007)
Fortune, S.: A sweepline algorithm for Voronoi diagrams. In: SoCG 1986. Proc. 2nd Annu. Sympos. Comput. Geom., pp. 313–322 (1986)
Giménez, O., Noy, M.: The number of planar graphs and properties of random planar graphs. In: Martínez, C. (ed.) ICAA 2005. Proc. Internat. Conf. Anal. Algorithms, DMTCS Proceedings, vol. AD, pp. 147–156 (2005)
Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. J. Graph Algorithms Appl. 6(1), 115–129 (2002)
Koebe, P.: Kontaktprobleme der konformen Abbildung. Ber. Sächs. Akad. Wiss. Leipzig, Math.-Phys. Klasse 88, 141–164 (1936)
Mitchell, J.S.B.: L1 shortest paths among polygonal obstacles in the plane. Algorithmica 8, 55–88 (1992)
Pach, J., Agarwal, P.K.: Combinatorial Geometry. John Wiley and Sons, New York (1995) (contains a proof of Koebe’s theorem)
Sachs, H.: Coin graphs, polyhedra, and conformal mapping. Discrete Math. 134(1-3), 133–138 (1994)
Thurston, W.P.: The Geometry and Topology of 3-Manifolds. Princeton University Notes, Princeton (1980)
Toussaint, G.T.: A graph-theoretical primal sketch. In: Toussaint, G.T. (ed.) Computational Morphology: A Computational Geometric Approach to the Analysis of Form, North-Holland, pp. 229–260 (1988)
Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H.A. (ed.) New Results and New Trends in Computer Science. LNCS, vol. 555, pp. 359–370. Springer, Heidelberg (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Atienza, N. et al. (2008). Cover Contact Graphs. In: Hong, SH., Nishizeki, T., Quan, W. (eds) Graph Drawing. GD 2007. Lecture Notes in Computer Science, vol 4875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77537-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-77537-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77536-2
Online ISBN: 978-3-540-77537-9
eBook Packages: Computer ScienceComputer Science (R0)