On extending a partial straight-line drawing

Authors:
Maurizio Patrignani
Affiliations:
Roma Tre University
Venue:
GD'05 Proceedings of the 13th international conference on Graph Drawing
Year:
2005

Citing 0
Cited 3

Point-set embeddings of trees with given partial drawings

Computational Geometry: Theory and Applications
Extending partial representations of interval graphs

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Extending partial representations of function graphs and permutation graphs

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.