Abstract
We prove that a contact system of Jordan arcs is stretchable if and only if it is extendable into a weak arrangement of pseudo-lines.
Chapter PDF
References
Colin de Verdière, E., Pocchiola, M., Vegter, G.: Tutte’s barycenter method applied to isotopies. In: Proc. 13th Canad. Conf. Comput. Geom. (2001)
Fáry, I.: On straight line representation of planar graphs. Acta Scientiarum Mathematicarum (Szeged) II, 229–233 (1948)
Linial, M., Lovász, L., Wigdersib, A.: Rubber bands, convex embeddings and graph connectivity. Combinatorica 8(1), 91–102 (1988)
Orden, D.: Two problems in geometric combinatorics: Efficient triangulations of the hypercube;plane graphs and rigidity., Ph.D. thesis, University of Santander, Spain (2003)
Shor, P.W.: Stretchability of pseudolines is NP-hard. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, pp. 531–554 (1991)
Stein, S.K.: Convex maps. Proc. Amer. Math. Soc. 2, 464–466 (1951)
Steinitz, E., Rademacher, H.: Vorlesung über die Theorie der Polyeder. Springer, Berlin (1934)
Thomassen, C.: Planarity and duality of finite and infinite planar graphs. J. Combinatorial Theory, Series B 29, 244–271 (1980)
Tutte, W.T.: Convex representations of graphs. In: Proc. London Math. Society, vol. 10, pp. 304–320 (1960)
Tutte, W.T.: How to draw a graph. In: Proc. London Math. Society, vol. 13, pp. 743–768 (1963)
Wagner, K.: Über eine Eigenschaft der Ebenen Komplexe. Math. Ann. 114, 570–590 (1937)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Fraysseix, H., de Mendez, P.O. (2004). Stretching of Jordan Arc Contact Systems. In: Liotta, G. (eds) Graph Drawing. GD 2003. Lecture Notes in Computer Science, vol 2912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-24595-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20831-0
Online ISBN: 978-3-540-24595-7
eBook Packages: Springer Book Archive