Stretching of Jordan Arc Contact Systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2912, Issue , 2004, Pages 71-85

  De Fraysseix, Hubert ^a   De Mendez, Patrice Ossona ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONTACT SYSTEMS; JORDAN ARCS; PSEUDO-LINES;

DRAWING (GRAPHICS);

EID: 33645612802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24595-7_7     Document Type: Article

References (11)

1. E. Colin de Verdière, M. Pocchiola, and G. Vegter, Tutte's barycenter method applied to isotopies, Proc. 13th Canad. Conf. Comput. Geom., 2001.
2. I. Fáry, On straight line representation of planar graphs, Acta Scientiarum Mathematicarum (Szeged) II (1948), 229-233.
3. M. Linial, L. Lovász, and A. Wigdersib, Rubber bands, convex embeddings and graph connectivity, Combinatorica 8 (1988), no. 1, 91-102.
4. D. Orden, Two problems in geometric combinatorics: Efficient triangulations of the hypercube;plane graphs and rigidity., Ph.D. thesis, University of Santander, Spain, 2003.
5. P. W. Shor, Stretchability of pseudolines is NP-hard, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 4 (1991), 531-554.
6. S.K. Stein, Convex maps, Proc. Amer. Math. Soc., vol. 2, 1951, pp. 464-466.
7. E. Steinitz and H. Rademacher, Vorlesung über die Theorie der Polyeder, Springer, Berlin, 1934.
8. C. Thomassen, Planarity and duality of finite and infinite planar graphs, J. Combinatorial Theory, Series B 29 (1980), 244-271.
9. W.T. Tutte, Convex representations of graphs, Proc. London Math. Society, vol. 10, 1960, pp. 304-320.
10. How to draw a graph, Proc. London Math. Society, vol. 13, 1963, pp. 743-768.
11. K. Wagner, Über eine Eigenschaft der Ebenen Komplexe, Math. Ann. 114 (1937), 570-590.