Abstract
We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)-sparse if every s-vertex subgraph has at most \(2s-k\) edges, and (2, k)-tight if in addition it has exactly \(2n-k\) edges, where n is the number of vertices. Every graph with a CCA-representation is planar and (2, 0)-sparse, and it follows from known results that for \(k\ge 3\) every (2, k)-sparse graph has a CCA-representation. Hence the question of CCA-representability is open for (2, k)-sparse graphs with \(0\le k\le 2\). We partially answer this question by computing CCA-representations for several subclasses of planar (2, 0)-sparse graphs. Next, we study CCA-representations in which each arc has an empty convex hull. We show that every plane graph of maximum degree 4 has such a representation, but that finding such a representation for a plane (2, 0)-tight graph with maximum degree 5 is NP-complete. Finally, we describe a simple algorithm for representing plane (2, 0)-sparse graphs with wedges, where each vertex is represented with a sequence of two circular arcs (straight-line segments).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S.G.: Proportional contact representations of planar graphs. J. Graph Algor. Appl. 16(3), 701–728 (2012)
Alam, M.J., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Pupyrev, S.: Balanced circle packings for planar graphs. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 125–136. Springer, Heidelberg (2014)
Alam, M.J., Eppstein, D., Kaufmann, M., Kobourov, S.G., Pupyrev, S., Schulz, A., Ueckerdt, T.: Contact representations of sparse planar graphs. CoRR, abs/1501.00318 (2015)
Bernardi, O., Fusy, É.: A bijection for triangulations, quadrangulations, pentagulations, etc. J. Combinatorial Th., Ser. A 119(1), 218–244 (2012)
de Castro, N., Cobos, F., Dana, J., Márquez, A., Noy, M.: Triangle-free planar graphs and segment intersection graphs. J. Graph Algor. Appl. 6(1), 7–26 (2002)
de Fraysseix, H., Ossona de Mendez, P.: On topological aspects of orientations. Discrete Math. 229(1–3), 57–72 (2001)
de Fraysseix, H., Ossona de Mendez, P.: Barycentric systems and stretchability. Discrete Applied Math. 155(9), 1079–1095 (2007)
de Fraysseix, H., Ossona de Mendez, P.: Representations by contact and intersection of segments. Algorithmica 47(4), 453–463 (2007)
Duncan, C.A., Gansner, E.R., Hu, Y., Kaufmann, M., Kobourov, S.G.: Optimal polygonal representation of planar graphs. Algorithmica 63(3), 672–691 (2012)
Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal and constrained rectangular layouts. SIAM J. Comput. 41(3), 537–564 (2012)
Fekete, Z., Jordán, T., Whiteley, W.: An inductive construction for plane laman graphs via vertex splitting. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 299–310. Springer, Heidelberg (2004)
Gonçalves, D., Lévêque, B., Pinlou, A.: Triangle contact representations and duality. Discrete Comput. Geom. 48(1), 239–254 (2012)
Haas, R., Orden, D., Rote, G., Santos, F., Servatius, B., Servatius, H., Souvaine, D.L., Streinu, I., Whiteley, W.: Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. Th. Appl. 31(1–2), 31–61 (2005)
Henneberg, L.: Die graphische Statik der starren Systeme. BG Teubner (1911)
Hliněný, P.: Classes and recognition of curve contact graphs. J. Combinatorial Th., Ser. B 74(1), 87–103 (1998)
Koebe, P.: Kontaktprobleme der konformen Abbildung. Ber. Sächs. Akad., Math.-Phys. Klasse 88, 141–164 (1936)
Lee, A., Streinu, I.: Pebble game algorithms and sparse graphs. Discrete Math. 308(8), 1425–1437 (2008)
Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55(2) (2008)
Nash-Williams, C.S.J.A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36, 445–450 (1961)
Nixon, A.: Rigidity on Surfaces. PhD thesis, Lancaster University (2011)
Nixon, A., Owen, J.: An inductive construction of (2, 1)-tight graphs (2011) (unpublished preprint)
Schulz, A.: Drawing graphs with few arcs. In: Brandstädt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 406–417. Springer, Heidelberg (2013)
Whiteley, W.: Some matroids from discrete applied geometry. In: Matroid Theory. Contemp. Math., vol. 197, pp. 171–311. Amer. Math. Soc. (1996)
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
Alam, M.J. et al. (2015). Contact Graphs of Circular Arcs. 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_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-21840-3_1
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)