Complexity Results for Three-dimensional Orthogonal Graph Drawing
Patrignani, Maurizio (2006) Complexity Results for Three-dimensional Orthogonal Graph Drawing. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 368-379 (Official URL: http://dx.doi.org/10.1007/11618058_33).
Full text not available from this repository.
We introduce the 3SAT reduction framework which can be used to prove the NP-hardness of finding three-dimensional orthogonal drawings with specific constraints. We use it to show that finding a drawing of a graph whose edges have a fixed shape is NP-hard. Also, it is NP-hard finding a drawing of a graph with nodes at prescribed positions when a maximum of two bends per edge is allowed. We comment the impact of these results on the two open problems of determining whether a graph always admits a 3D orthogonal drawing with at most two bends per edge and of characterizing orthogonal shapes admitting a drawing without intersections.
Repository Staff Only: item control page