Abstract
We study the planar orthogonal drawing style within the framework of partial representation extension. Let be a partial orthogonal drawing, i.e., G is a graph, is a subgraph and is a planar orthogonal drawing of H. We show that the existence of an orthogonal drawing of that extends can be tested in linear time. If such a drawing exists, then there also is one that uses bends per edge. On the other hand, we show that it is NP-complete to find an extension that minimizes the number of bends or has a fixed number of bends per edge.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.