Abstract

We study the planar orthogonal drawing style within the framework of partial representation extension. Let (G,H,ΓH)(G,H,Γ_H ) be a partial orthogonal drawing, i.e., G is a graph, H⊆GH\subseteq G is a subgraph and ΓHΓ_H is a planar orthogonal drawing of H. We show that the existence of an orthogonal drawing ΓGΓ_G of GG that extends ΓHΓ_H can be tested in linear time. If such a drawing exists, then there also is one that uses O(∣V(H)∣)O(|V(H)|) 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.