Abstract
A contact graph representation is a classical graph drawing style in which vertices are represented by geometric objects such that edges correspond to contacts between objects. Based on a characterization of stretchable systems of pseudo segments, we present a new approach for constructing a wide range of contact graph representations. Using Courcelle’s theorem, some useful fixed-parameter tractability results are derived. Our approach can also be applied to giving quick proofs for some existing results of contact graph representations. We feel that the technique developed in the paper gives new insight to the study of contact representations of plane graphs.
H.-C. Yen—Research supported in part by Ministry of Science and Technology of Taiwan under Grant MOST-103-2221-E-002-154-MY3.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aerts, N., Felsner, S.: Straight line triangle representations. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 119–130. Springer, Heidelberg (2013)
Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S.G., Ueckert, T.: Computing Cartograms with Optimal Complexity. Discrete & Computational Geometry 50(3), 784–810 (2013)
Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation 85(1), 12–75 (1990)
Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press (2012)
De Fraysseix, H., de Mendez, P.O.: Barycentric systems and stretchability. Discrete Applied Mathematics 155(9), 1079–1095 (2007)
Downey, R., Fellows, M.: Fundamentals of Parameterized Complexity. Springer (2013)
Duncan, C., Gansner, E., Hu, Y., Kaufmann, M., Kobourov, S.: Optimal Polygonal Representation of Planar Graphs. Algorithmica 63(3), 672–691 (2012)
Evans, W., Felsner, S., Kaufmann, M., Kobourov, S.G., Mondal, D., Nishat, R.I., Verbeek, K.: Table cartograms. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 421–432. Springer, Heidelberg (2013)
Fowler, J.J.: Strongly-connected outerplanar graphs with proper touching triangle representations. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 155–160. Springer, Heidelberg (2013)
Gansner, E.R., Hu, Y., Kobourov, S.G.: On touching triangle graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 250–261. Springer, Heidelberg (2011)
Kobourov, S.G., Mondal, D., Nishat, R.I.: Touching triangle representations for 3-connected planar graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 199–210. Springer, Heidelberg (2013)
Koebe, P.: Kontaktprobleme der konformen Abbil-dung. Ber. Verh. Sachs. Akademie der Wissenschaften Leipzig, Math.-Phys. Klasse 88, 141–164 (1936)
Ueckerdt, T.: Geometric Representations of Graphs with low Polygonal Complexity. PhD thesis, Technische Universität Berlin (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Chang, YJ., Yen, HC. (2015). A New Approach for Contact Graph Representations and Its Applications. In: Dehne, F., Sack, JR., Stege, U. (eds) Algorithms and Data Structures. WADS 2015. Lecture Notes in Computer Science(), vol 9214. Springer, Cham. https://doi.org/10.1007/978-3-319-21840-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-21840-3_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21839-7
Online ISBN: 978-3-319-21840-3
eBook Packages: Computer ScienceComputer Science (R0)