Optimal Compaction of Orthogonal Grid Drawings
نویسندگان
چکیده
We consider the two{dimensional compaction problem for orthogonal grid drawings in which the task is to alter the coordinates of the vertices and edge segments while preserving the shape of the drawing so that the total edge length is minimized. The problem is closely related to two{dimensional compaction in vlsi{design and is conjectured to be NP{hard. We characterize the set of feasible solutions for the two{dimensional compaction problem in terms of paths in the so{called constraint graphs in x{ and y{direction. Similar graphs (known as layout graphs) have already been used for one{dimensional compaction in vlsi{design, but this is the rst time that a direct connection between these graphs is established. Given the pair of constraint graphs, the two{dimensional compaction task can be viewed as extending these graphs by new arcs so that certain conditions are satis ed and the total edge length is minimized. We can recognize those instances having only one such extension; for these cases we can solve the compaction problem in polynomial time. We have transformed the geometrical problem into a graph{theoretical one which can be formulated as an integer linear program. Our computational experiments have shown that the new approach works well in practice. It is the rst time that the two{dimensional compaction problem is formulated as an integer linear program.
منابع مشابه
An Experimental Comparison of Orthogonal Compaction Algorithms
We present an experimental study in which we compare the state-of-the-art methods for compacting orthogonal graph layouts. Given the shape of a planar orthogonal drawing, the task is to place the vertices and the bends on grid points so that the total area or the total edge length is minimised. We compare four constructive heuristics based on rectangular dissection and on turn-regularity, also ...
متن کاملOptimal three-dimensional orthogonal graph drawing in the general position model
Let G be a graph with maximum degree at most six. A three-dimensional orthogonal drawing of G positions the vertices at grid-points in the three-dimensional orthogonal grid, and routes edges along grid lines such that edge routes only intersect at common end-vertices. In this paper, we consider three-dimensional orthogonal drawings in the general position model; here no two vertices are in a co...
متن کاملR O M a on the Complexity of Orthogonal Compaction
We consider three closely related optimization problems arising from the graph drawing and the VLSI research areas and conjectured to be NP hard and we prove that in fact they are NP complete Starting from an orthogonal representation of a graph i e a description of the shape of the edges that does not specify segment lengths or vertex positions the three problems consist of providing an orthog...
متن کاملOrthogonal Compaction using Additional Bends
Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a onedimensional compaction algorithm that alters the orthogonal shape of edges for better geometric results. An experimental evaluation shows that we were able to reduce the total edge length and the drawing...
متن کاملExperiments on Area Compaction Algorithms for Orthogonal Drawings
This paper presents an experimental study on several compaction algorithms for orthogonal drawings of graphs. We concentrate on algorithms that minimize the area, and compare them with other representative compaction algorithms in the state of the art. In particular, we propose a new exact algorithm that minimizes the total edge length subject to the optimization of the area, and experimentally...
متن کامل