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 in combination with two improvement heuristics based on longest paths and network flows, and an exact method which is able to compute provable optimal drawings of minimum total edge length. We provide a performance evaluation in terms of quality and running time. The test data consists of two test-suites already used in previous experimental research. In order to get hard instances, we randomly generated an additional set of planar graphs.
منابع مشابه
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...
متن کامل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...
متن کاملCombining Graph Labeling and Compaction
Combinations of graph drawing and map labeling problems yield challenging mathematical problems and have direct applications, e.g., in automation engineering. We call graph drawing problems in which subsets of vertices and edges need to be labeled graph labeling problems. Unlike in map labeling where the position of the objects is specified in the input, the coordinates of vertices and edges in...
متن کاملThe Orientation Adaptive Lapped Orthogonal Transform for Image Coding
In this paper, a lapped orthogonal transform adapted for local directionality of an image is proposed and its application in adaptive image coding is presented. First, we address the problem to construct the lapped orthogonal transform with short and long functions such that the long functions are twice the length of the short functions, and derive the transform with the optimal short functions...
متن کاملImage Compression Algorithms under JPEG with Lapped Orthogonal Transform and Discrete Cosine Transformation
This Paper Focus On Image Compression.It is used specially for the compression of images where tolerable degradation is required. With the wide use of computers and consequently need for large scale storage and transmission of data, efficient ways of storing of data have become necessary. Image compression is minimizing the size in bytes of a graphics file without degrading the quality of the i...
متن کامل