Abstract
We investigate the computational complexity of the following problem. Given a planar graph in which some vertices have already been placed in the plane, place the remaining vertices to form a planar straight-line drawing of the whole graph. We show that this extensibility problem, proposed in the 2003 “Selected Open Problems in Graph Drawing” [1], is NP-complete.
Work partially supported by European Commission – Fet Open project DELIS – Dynamically Evolving Large Scale Information Systems – Contract no 001907, by “Project ALGO-NEXT: Algorithms for the Next Generation Internet and Web: Methodologies, Design, and Experiments”, MIUR Programmi di Ricerca Scientifica di Rilevante Interesse Nazionale, and by “The Multichannel Adaptive Information Systems (MAIS) Project”, MIUR–FIRB.
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
Brandenburg, F., Eppstein, D., Goodrich, M.T., Kobourov, S., Liotta, G., Mutzel, P.: Selected open problems in graph drawing. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 515–539. Springer, Heidelberg (2004)
Cabello, S.: Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. In: Proc. 20th European Workshop on Computational Geometry (2004)
Fary, I.: On straight lines representation of planar graphs. Acta Sci. Math. Szeged 11, 229–233 (1948)
Freitag, L.A., Plassman, P.E.: Local optimization-based untangling algorithms for quadrilateral meshes. In: Proc. 10th int. Meshing Roundtable, pp. 397–406 (2001)
Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329–343 (1982)
Stein, S.K.: Convex maps. Proc. Amer. Math. Soc. 2(3), 464–466 (1951)
Steinitz, E., Rademacher, H.: Vorlesungen über die Theorie der Polyeder. Julius. Springer, Berlin (1934)
Tutte, W.T.: How to draw a graph. Proceedings London Mathematical Society 13(52), 743–768 (1963)
Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung 46, 26–32 (1936)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Patrignani, M. (2006). On Extending a Partial Straight-Line Drawing. In: Healy, P., Nikolov, N.S. (eds) Graph Drawing. GD 2005. Lecture Notes in Computer Science, vol 3843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11618058_34
Download citation
DOI: https://doi.org/10.1007/11618058_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31425-7
Online ISBN: 978-3-540-31667-1
eBook Packages: Computer ScienceComputer Science (R0)